Table Of Content

MATHEMATICS OF OPERATIONS RESEARCH Vol. 30, No. 4. November 2005. pp 1039-1040 inf. ISSN 0364-765X EISSN 1526-5471 |0 5 3004 | 1039 pot 10.1287/moor.1050.0185 © 2005 INFORMS Author Index of Volume 30 Adelman, Daniel; Klabjan, Diego. Duality and Einstein, Ori; Hassin, Refael. The Number of Existence of Optimal Policies in Generalized Solutions Sufficient for Solving a Family of Joint Replenishment. 28 Problems. 880 Alvarez, Felipe; Carrasco, Miguel; Pichard, Karine Fleischer, Lisa; Sethuraman, Jay. Efficient Algorithms Convergence of a Hybrid Projection-Proximal for Separated Continuous Linear Programs: The Point Algorithm Coupled with Approximation Multicommodity Flow Problem with Holding Methods in Convex Optimization. 966 Costs and Extensions. 916. Amaldi, Edoardo; Hauser, Raphael. Boundedness Flores-Bazan, Fabian; Lopez, Ruben. The Linear Theorems for the Relaxation Method. 939 Complementarity Problem Under Asymptotic Arutyunov, Aram V.; Izmailov Alexey F. Sensitivity Analysis. 73 Analysis for Cone-Constrained Optimization Foldes, Stephan; Hammer, Peter L. Submodularity, Problems Under the Relaxed Constraint Qualifications. 333 Supermodularity, and Higher-Order Balaji, R.; Parthasarathy, T.; Sampangi Raman, D.; Monotonicities of Pseudo-Boolean Functions. Vetrivel, V. On the Lipschitz Continuity of 453 the Solution Map in Semidefinite Linear Freund, Robert M.; Orddéfiez, Fernando. On an Complementarity Problems. 462 Extension of Condition Number Theory to Bansal, Nikhil; Mahdian Mohammad; Sviridenko, Nonconic Convex Optimization. 173 Maxim Minimizing Makespan in No-Wait Job Fukushima, Masao; see Chen, Xiaojun Shops 817 Goffin, Jean-Louis; see Oskoorouchi, Mohammad R Bergantifios, Gustavo; Vidal-Puga, Juan. The Gowda, M. Seetharama; see Tao, Jiyuan Const tent Coalitional Value 832 Hajek, Bruce; Seri, Pierre. Lex-Optimal Online Borst, Sem Zwart, Bert Fluid Que ues with Multiclass Scheduling with Hard Deadlines 562 Hea Tailed M/G x0 Input. 852 Hammer, Peter L.; see Foldes, Stephan ‘aprara Alberto; Lodi Andrea; Monaci, lichele Hare, W L.; Lewis, A. S. Estimating Tangent and Fast Approximation Schemes for Two-Stage Normal Cones Without Calculus 785 Twe Dimensional Bin Packing 150 Hassin, Refael see Einstein, Ori arrasco, Miguel; see Alvarez, Felipe Hauser, Raphael; see Amaldi, Edoardo asey Michael S.; Sen Suvrajeet The Scenario Haussmann, Ulrich G.; see Chiarolla, Maria B. Generation 4/gorithm for Multistage Stochastic He, Yiran; Sun, Jie. Error Bounds for Degenerate Linear Programming. 615 ‘hen Bo: see Zhang, Jiawei Cone Inclusion Problems. 701 ‘hen Xiaojun; Fukushima, Masao. Expected Hordijk, Arie; van der Laan, Dinard. On the Average Residual Minimization Method for Stochastic Waiting Time for Regular Routing to Linear Complementarity Problems 1022 Deterministic Queues. 521 ‘hiarolla, Maria B.; Haussmann, Ulrich G. Explicit Hu, Hui Characterizations of the Strong Basic Solution of a Stochastic, Irreversible Investment Constraint Qualifications. 956 Problem and Its Moving Threshold. 91 lyengar, Garud N. Robust Dynamic Programming orrea, José R.; Schulz Andreas S. Single-Machine Scheduling with Precedence Constraints 1005 Izmailov, Alexey F.; see Arutyunov, Aram V. Décamps, Jean-Paul; Mariotti, Thomas; Villeneuve, Klabjan, Diego; see Adelman, Daniel. Stéphane. /nvestment Timing Under Incomplete L6pez, Ruben; see Flores-Bazan, Fabian. Information. 472 Lasserre, Jean B.; Zeron, Eduardo S. An Alternative Dash, Sanjeeb. Exponential Lower Bounds on the Algorithm for Counting Lattice Points in a Lengths of Some Classes of Branch-and-Cut Convex Polytope. 597 Proofs. 678 Levy, Adam B. Convergence of Successive Deb, Supratim; Shakkottai, Sanjay; Srikant, R Approximation Methods with Parameter Target Asymptotic Behavior of Internet Congestion Sets. 765 Controllers in a Many-Flows Regime. 420 Lewis, A. S.; see Hare, W. L Di Pillo, Gianni; Lucidi, Stefano; Palagi, Laura. Convergence to Second-Order Stationary Points Lian, Zhaotong; Liu, Liming; Neuts, Marcel F. of a Primal-Dual Algorithm Model for A Discrete-Time Model for Common Lifetime Nonlinear Programming. 897 Inventory Systems. 718. Dokov, Steftcho P.; Morton, David P. Second-Order Liu, Liming; see Lian, Zhaotong. Lower Bounds on the Expectation of a Convex Lodi, Andrea; see Caprara, Alberto. Function. 662 Lucidi, Stefano; see Di Pillo, Gianni. 1039 1040 2005 INFORMS see Deb, Suy atin Sensitivity Ana meterized Variational Ineau Adam; Weiss, Alan. Large De } Rates Pe) StH) Steftcho P. Ziateva. Nadia ukhovich, Boris S * s. John N.: see Mannor. Shie 1anoy tongTi ler | Laan, Dinard. Ro'4 uti? Robert M ervie nN Jean-Louis mn ck sat ina Aric 7