Mathematics of Operations Research, Volume 34

Volume 34, Number 1, February 2009

• Aharon Ben-Tal, Arkadi Nemirovski:
  On Safe Tractable Approximations of Chance-Constrained Linear Matrix Inequalities. 1-25
  
• Kevin D. Glazebrook, R. Minty:
  A Generalized Gittins Index for a Class of Multiarmed Bandits with General Resource Requirements. 26-44
  
• Amarjit Budhiraja, Chihoon Lee:
  Stationary Distribution Convergence for Generalized Jackson Networks in Heavy Traffic. 45-56
  
• Wojciech Olszewski, Alvaro Sandroni:
  Strategic Manipulation of Empirical Tests. 57-70
  
• Nelly Litvak, Vladimir Ejov:
  Markov Chains and Optimality of the Hamiltonian Cycle. 71-82
  
• Werner Schachinger, Immanuel M. Bomze:
  A Conic Duality Frank-Wolfe-Type Theorem via Exact Penalization in Quadratic Optimization. 83-91
  
• Nicholas G. Hall, Marc E. Posner, Chris N. Potts:
  Online Scheduling with Known Arrival Times. 92-102
  
• Woonghee Tim Huh, Paat Rusmevichientong:
  A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand. 103-123
  
• Houduo Qi:
  Local Duality of Nonlinear Semidefinite Programming. 124-141
  
• Ramandeep S. Randhawa, Sunil Kumar:
  Multiserver Loss Systems with Subscribers. 142-179
  
• Yurii Nesterov:
  Unconstrained Convex Minimization in Relative Scale. 180-193
  
• Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey:
  Network Formulations of Mixed-Integer Programs. 194-209
  
• Juliana M. Nascimento, Warren B. Powell:
  An Optimal Approximate Dynamic Programming Algorithm for the Lagged Asset Acquisition Problem. 210-237
  
• José R. Correa, Asaf Levin:
  Monotone Covering Problems with an Additional Covering Constraint. 238-248
  
• Manuel Klein:
  Comment on "Investment Timing Under Incomplete Information". 249-254
  
• Jean-Paul Décamps, Thomas Mariotti, Stéphane Villeneuve:
  Investment Timing Under Incomplete Information: Erratum. 255-256
  

Volume 34, Number 2, May 2009

• Jean-François Mertens, Abraham Neyman, Dinah Rosenberg:
  Absorbing Games with Compact Action Spaces. 257-262
  
• Josef Hofbauer, Sylvain Sorin, Yannick Viossat:
  Time Average Replicator and Best-Reply Dynamics. 263-269
  
• Niv Buchbinder, Joseph Naor:
  Online Primal-Dual Algorithms for Covering and Packing. 270-286
  
• Vikram Krishnamurthy, Bo Wahlberg:
  Partially Observed Markov Decision Process Multiarmed Bandits - Structural Results. 287-302
  
• Alfred Auslender, Miguel A. Goberna, Marco A. López:
  Penalty and Smoothing Methods for Convex Semi-Infinite Programming. 303-319
  
• Xin Guo, Robert A. Jarrow, Yan Zeng:
  Credit Risk Models with Incomplete Information. 320-332
  
• Carri W. Chan, Vivek F. Farias:
  Stochastic Depletion Problems: Effective Myopic Policies for a Class of Dynamic Optimization Problems. 333-350
  
• Kenjiro Takazawa:
  A Weighted k_{t, t}-Free t-Factor Algorithm for Bipartite Graphs. 351-362
  
• Itay Gurvich, Ward Whitt:
  Queue-and-Idleness-Ratio Controls in Many-Server Service Systems. 363-396
  
• Woonghee Tim Huh, Ganesh Janakiraman, John A. Muckstadt, Paat Rusmevichientong:
  An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand. 397-416
  
• Viswanath Nagarajan, Maxim Sviridenko:
  Tight Bounds for Permutation Flow Shop Scheduling. 417-427
  
• Daniel Kuhn:
  An Information-Based Approximation Scheme for Stochastic Optimization Problems in Continuous Time. 428-444
  
• Bogdan Grechuk, Anton Molyboha, Michael Zabarankin:
  Maximum Entropy Principle with General Deviation Measures. 445-467
  
• Justin Salez, Devavrat Shah:
  Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem. 468-480
  
• Peter Sanders, Naveen Sivadasan, Martin Skutella:
  Online Scheduling with Bounded Migration. 481-498
  
• Nadine Baumann, Martin Skutella:
  Earliest Arrival Flows with Multiple Sources. 499-512