Operations Research Letters, Volume 27

Volume 27, Number 1, August 2000

• Manfred Padberg:
  Approximating separable nonlinear functions via mixed zero-one programs. 1-5
  
• Robert A. Bosch:
  Maximum density stable patterns in variants of Conway's game of Life. 7-11
  
• Alejandro Crema:
  An algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix. 13-19
  
• David Perry, Wolfgang Stadje:
  Inventory systems for goods with censored random lifetimes. 21-27
  
• Igor S. Litvinchev:
  On improved Choi-Goldfarb solution-containing ellipsoids in linear programming. 29-37
  
• R. E. Lillo, M. Martín:
  On optimal exhaustive policies for the M/G/1-queue. 39-46
  

Volume 27, Number 2, September 2000

• Diego Klabjan, Ellis L. Johnson, George L. Nemhauser:
  A parallel primal-dual simplex algorithm. 47-55
  
• Igor Averbakh:
  Minmax regret solutions for minimax optimization problems with uncertainty. 57-65
  
• Edmond J. Vanderperre:
  A Sokhotski-Plemelj problem related to a robot-safety device system. 67-71
  
• Samuli Aalto, Werner R. W. Scheinhardt:
  Tandem fluid queues fed by homogeneous on-off sources. 73-82
  
• W. P. M. H. Heemels, J. M. Schumacher, Siep Weiland:
  Projected dynamical systems in a complementarity formalism. 83-91
  

Volume 27, Number 3, October 2000

• Gerhard J. Woeginger:
  Monge strikes again: optimal placement of web proxies in the internet. 93-96
  
• Gérard Cornuéjols, Luis F. Zuluaga:
  On Padberg's conjecture about almost totally unimodular matrices. 97-99
  
• Markku Kallio, Seppo Salo:
  An interior point method for solving systems of linear equations and inequalities. 101-107
  
• Albert P. M. Wagelmans, A. E. Gerodimos:
  Improved dynamic programs for some batching problems involving the maximum lateness criterion. 109-118
  
• Alexei B. Piunovskiy, X. Mao:
  Constrained Markovian decision processes: the dynamic programming approach. 119-126
  
• David Perry:
  Control limit policies in a replacement model with additive phase-type distributed damage and linear restoration. 127-134
  
• Alfredo Garcia, Robert L. Smith:
  Solving nonstationary infinite horizon stochastic production planning problems. 135-141
  

Volume 27, Number 4, November 2000

• Donald K. Wagner:
  Shortest paths in almost acyclic graphs. 143-147
  
• Jean B. Lasserre:
  Why the logarithmic barrier function in convex and linear programming? 149-152
  
• Lázaro Cánovas, Mercedes Landete, Alfredo Marín:
  New facets for the set packing polytope. 153-161
  
• David Perry, Wolfgang Stadje, Shelemyahu Zacks:
  Busy period analysis for M/G/1 and G/M/1 type queues with restricted accessibility. 163-174
  
• Sotirios Papachristos, K. Skouri:
  An optimal replenishment policy for deteriorating items with time-varying demand and partial-exponential type - backlogging. 175-184
  
• Alessandro Agnetis, Dario Pacciarelli:
  Part sequencing in three-machine no-wait robotic cells. 185-192
  

Volume 27, Number 5, December 2000

• Han Hoogeveen, Chris N. Potts, Gerhard J. Woeginger:
  On-line scheduling on a single machine: maximizing the number of early jobs. 193-197
  
• S. Thomas McCormick, Akiyoshi Shioura:
  Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. 199-207
  
• Amir Beck, Marc Teboulle:
  A probabilistic result for the max-cut problem on random graphs. 209-214
  
• Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger:
  Semi-online scheduling with decreasing job sizes. 215-221
  
• Andrzej Czygrinow:
  Maximum dispersion problem in dense graphs. 223-227
  
• Ülkü Gürler, Mustafa Ç. Pinar, Mohamed Mehdi Jelassi:
  On closed-form solutions of a resource allocation problem in parallel funding of R&D projects. 229-234
  
• Soohan Ahn, Gyemin Lee, Jongwoo Jeon:
  Analysis of the M/D/1-type queue based on an integer-valued first-order autoregressive process. 235-241