Operations Research Letters, Volume 25

Volume 25, Number 1, August 1999

• Aharon Ben-Tal, Arkadi Nemirovski:
  Robust solutions of uncertain linear programs. 1-13
  Electronic Edition (link) BibTeX
• Virginie Gabrel, Arnaud Knippel, Michel Minoux:
  Exact solution of multicommodity network optimization problems with general step cost functions. 15-23
  Electronic Edition (link) BibTeX
• Joseph Abate, Ward Whitt:
  Explicit M/G/1 waiting-time distributions for a class of long-tail service-time distributions. 25-31
  Electronic Edition (link) BibTeX
• Carlo Filippi:
  A reverse search algorithm for the neighborhood problem. 33-37
  Electronic Edition (link) BibTeX
• Csaba Mészáros:
  Steplengths in interior-point algorithms of quadratic programming. 39-45
  Electronic Edition (link) BibTeX
• Gerhard J. Woeginger, Guochuan Zhang:
  Optimal on-line algorithms for variable-sized bin covering. 47-50
  Electronic Edition (link) BibTeX

Volume 25, Number 2, September 1999

• Fangruo Chen:
  Worst-case analysis of (R, Q) policies in a two-stage serial inventory system with deterministic demand and backlogging. 51-58
  Electronic Edition (link) BibTeX
• Sy-Ming Guu:
  Properties of the multiple lot-sizing problem with rigid demand, general cost structures, and interrupted geometric yield. 59-65
  Electronic Edition (link) BibTeX
• Masaaki Kijima, Tetsu Takimoto:
  A (T, S) inventory/production system with limited production capacity and uncertain demands. 67-79
  Electronic Edition (link) BibTeX
• Agostinho Agra, Miguel Constantino:
  Lotsizing with backlogging and start-ups: the case of Wagner-Whitin costs. 81-88
  Electronic Edition (link) BibTeX
• Duan Li:
  Zero duality gap in integer programming: P-norm surrogate constraint method. 89-96
  Electronic Edition (link) BibTeX
• Geir Dahl:
  Notes on polyhedra associated with hop-constrained paths. 97-100
  Electronic Edition (link) BibTeX
• Fen-Hui Lin, Way Kuo, Frank Hwang:
  Structure importance of consecutive-k-out-of-n systems. 101-107
  Electronic Edition (link) BibTeX

Volume 25, Number 3, October 1999

• Edward G. Coffman Jr., Predrag R. Jelenkovic:
  Performance of the move-to-front algorithm with Markov-modulated request sequences. 109-118
  Electronic Edition (link) BibTeX
• Mauro Dell'Amico, Martine Labbé, Francesco Maffioli:
  Exact solution of the SONET Ring Loading Problem. 119-129
  Electronic Edition (link) BibTeX
• T. Bonald, D. Down:
  Stability of mixed generalized Jackson networks. 131-136
  Electronic Edition (link) BibTeX
• Dragomir D. Dimitrijevic:
  A solution to mean delay in the SigmaM_c/G_ck/1 cyclic priority queue with cycle (k) and class (c) dependent feedback and service times. 137-145
  Electronic Edition (link) BibTeX
• Eui Yong Lee, Jiyeon Lee:
  An optimal proportion of perfect repair. 147-148
  Electronic Edition (link) BibTeX

Volume 25, Number 4, November 1999

• Jing Hu, Ellis L. Johnson:
  Computational results with a primal-dual subproblem simplex method. 149-157
  Electronic Edition (link) BibTeX
• Michael Patriksson, Laura Wynter:
  Stochastic mathematical programs with equilibrium constraints. 159-167
  Electronic Edition (link) BibTeX
• Toshihiro Fujito:
  On approximation of the submodular set cover problem. 169-174
  Electronic Edition (link) BibTeX
• Vittorio Maniezzo, Aristide Mingozzi:
  The project scheduling problem with irregular starting time costs. 175-182
  Electronic Edition (link) BibTeX
• Cornelis Roos, Tamás Terlaky:
  Note on a paper of Broyden. 183-186
  Electronic Edition (link) BibTeX
• J. Preater:
  The best-choice problem for partially ordered objects. 187-190
  Electronic Edition (link) BibTeX
• J. Ben Atkinson:
  On some parallels between the loss probability in the GI/G/1 loss system and the delay probability in the GI/G/1 queue. 191-194
  Electronic Edition (link) BibTeX
• Michael K. Ng:
  A note on policy algorithms for discounted Markov decision problems. 195-197
  Electronic Edition (link) BibTeX

Volume 25, Number 5, December 1999

• Fabián A. Chudak, Dorit S. Hochbaum:
  A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. 199-204
  Electronic Edition (link) BibTeX
• Donald Goldfarb, Zhiying Jin:
  A new scaling algorithm for the minimum cost network flow problem. 205-211
  Electronic Edition (link) BibTeX
• Tugrul Sanli, Vidyadhar G. Kulkarni:
  Optimal admission to reader-writer systems with no queueing. 213-218
  Electronic Edition (link) BibTeX
• Richard Loulou, Amit Kanudia:
  Minimax regret strategies for greenhouse gas abatement: methodology and application. 219-230
  Electronic Edition (link) BibTeX
• Yunbin Zhao:
  Existence of a solution to nonlinear variational inequality under generalized positive homogeneity. 231-239
  Electronic Edition (link) BibTeX
• P. Vijaya Laxmi, U. C. Gupta:
  On the finite-buffer bulk-service queue with general independent arrivals: GI/M^[b]/1/N. 241-245
  Electronic Edition (link) BibTeX