Operations Research Letters, Volume 28

Volume 28, Number 1, February 2001

• Gérard Cornuéjols, Yanjun Li:
  Elementary closures for integer programs. 1-8
  Electronic Edition (link) BibTeX
• Margaréta Halická:
  Two simple proofs for analyticity of the central path in linear programming. 9-19
  Electronic Edition (link) BibTeX
• Igor V. Konnov:
  Relatively monotone variational inequalities over product sets. 21-26
  Electronic Edition (link) BibTeX
• Kenneth Mitchell:
  Constructing a correlated sequence of matrix exponentials with invariant first-order properties. 27-34
  Electronic Edition (link) BibTeX
• Ho Woo Lee, Won Joo Seo, Seung Hyun Yoon:
  An analysis of multiple-class vacation queues with individual thresholds. 35-49
  Electronic Edition (link) BibTeX

Volume 28, Number 2, March 2001

• B. Venkateshwara Rao, Richard M. Feldman:
  Approximations and bounds for the variance of steady-state waiting times in a GI/G/1 queue. 51-62
  Electronic Edition (link) BibTeX
• Fabrizio Rossi, Stefano Smriglio:
  A branch-and-cut algorithm for the maximum cardinality stable set problem. 63-74
  Electronic Edition (link) BibTeX
• F. K. Hwang:
  A new index of component importance. 75-79
  Electronic Edition (link) BibTeX
• Hoang Q. Tuyen, Le D. Muu:
  Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem. 81-92
  Electronic Edition (link) BibTeX
• Laurens Cherchye, Tom Van Puyenbroeck:
  A comment on multi-stage DEA methodology. 93-98
  Electronic Edition (link) BibTeX

Volume 28, Number 3, April 2001

• Alfred Sham, Y. June Wu, J. David Fuller:
  Assessment of several algorithms for multi-period market equilibrium models with geometric distributed lag demand. 99-106
  Electronic Edition (link) BibTeX
• Gregory Gutin, Anders Yeo:
  TSP tour domination and Hamilton cycle decompositions of regular digraphs. 107-111
  Electronic Edition (link) BibTeX
• Tava Lennon Olsen:
  Approximations for the waiting time distribution in polling models with and without state-dependent setups. 113-123
  Electronic Edition (link) BibTeX
• Heng Qing Ye, Hong Chen:
  Lyapunov method for the stability of fluid networks. 125-136
  Electronic Edition (link) BibTeX
• Gordon E. Willmot, Steve Drekic:
  On the transient analysis of the M^X/M/infinity queue. 137-142
  Electronic Edition (link) BibTeX
• Edmond J. Vanderperre:
  Point availability of a robot-safety device. 143-148
  Electronic Edition (link) BibTeX

Volume 28, Number 4, May 2001

• Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz:
  On project scheduling with irregular starting time costs. 149-154
  Electronic Edition (link) BibTeX
• Hanif D. Sherali:
  On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions. 155-160
  Electronic Edition (link) BibTeX
• Ismael R. de Farias Jr.:
  A family of facets for the uncapacitated p-median polytope. 161-167
  Electronic Edition (link) BibTeX
• Vladimir G. Deineko, Gerhard J. Woeginger:
  A comment on consecutive-2-out-of-n systems. 169-171
  Electronic Edition (link) BibTeX
• Jesus R. Artalejo, Alexander N. Dudin, Valentina I. Klimenok:
  Stationary analysis of a retrial queue with preemptive repeated attempts. 173-180
  Electronic Edition (link) BibTeX
• Jakob R. Møller:
  Tail asymptotics for M/G/1-type queueing processes with light-tailed increments. 181-185
  Electronic Edition (link) BibTeX
• Srinagesh Gavirneni:
  An efficient heuristic for inventory control when the customer is using a (s, S) policy. 187-192
  Electronic Edition (link) BibTeX
• Defeng Sun:
  A further result on an implicit function theorem for locally Lipschitz functions. 193-198
  Electronic Edition (link) BibTeX

Volume 28, Number 5, June 2001

• Chunfu Jia:
  Stochastic single machine scheduling with an exponentially distributed due date. 199-203
  Electronic Edition (link) BibTeX
• Philippe Baptiste, Vadim G. Timkovsky:
  On preemption redundancy in scheduling unit processing time jobs on two parallel machines. 205-212
  Electronic Edition (link) BibTeX
• Dean H. Lorenz, Danny Raz:
  A simple efficient approximation scheme for the restricted shortest path problem. 213-219
  Electronic Edition (link) BibTeX
• Zhiyi Tan, Yong He:
  Semi-on-line scheduling with ordinal data on two uniform machines. 221-231
  Electronic Edition (link) BibTeX
• Michel Mandjes:
  A note on queues with M/G/infinity input. 233-242
  Electronic Edition (link) BibTeX
• P. R. Parthasarathy, N. Selvaraju:
  Exact transient solution of a state-dependent queue in discrete time. 243-248
  Electronic Edition (link) BibTeX