Operations Research Letters, Volume 23

Volume 23, Numbers 1-2, 1 August 1998

• Nilotpal Chakravarti, Albert P. M. Wagelmans:
  Calculation of stability radii for combinatorial optimization problems. 1-7
  Electronic Edition (link) BibTeX
• Petra Schuurman:
  A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays. 9-11
  Electronic Edition (link) BibTeX
• Eddie Cheng:
  Separating subdivision of bicycle wheel inequalities over cut polytopes. 13-19
  Electronic Edition (link) BibTeX
• Geir Dahl:
  The 2-hop spanning tree problem. 21-26
  Electronic Edition (link) BibTeX
• P. T. Sokkalingam, Y. P. Aneja:
  Lexicographic bottleneck combinatorial problems. 27-33
  Electronic Edition (link) BibTeX
• Diego Klabjan, George L. Nemhauser, C. Tovey:
  The complexity of cover inequality separation. 35-40
  Electronic Edition (link) BibTeX
• Gerhard J. Woeginger:
  A comment on a minmax location problem. 41-43
  Electronic Edition (link) BibTeX
• Christian Kanzow, Masao Fukushima:
  Solving box constrained variational inequalities by using the natural residual with D-gap function globalization. 45-51
  Electronic Edition (link) BibTeX
• Jianmin Jiang:
  A long-step primal-dual path-following method for semidefinite programming. 53-61
  Electronic Edition (link) BibTeX
• Wheyming Tina Song, Chien-Chou Su:
  A three-class variance swapping technique for simulation experiments. 63-70
  Electronic Edition (link) BibTeX

Volume 23, Numbers 3-5, October 1998

• Lisa Fleischer, Éva Tardos:
  Efficient continuous-time dynamic network flow algorithms. 71-80
  Electronic Edition (link) BibTeX
• Joost P. Warners, Hans van Maaren:
  A two-phase algorithm for solving a class of hard satisfiability problems. 81-88
  Electronic Edition (link) BibTeX
• Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen:
  The partial constraint satisfaction problem: Facets and lifting theorems. 89-97
  Electronic Edition (link) BibTeX
• Alessandra Esposito, M. S. Fiorenzo Catalano, F. Malucelli, Luciano Tarricone:
  A new matrix bandwidth reduction algorithm. 99-107
  Electronic Edition (link) BibTeX
• Chunfu Jia:
  Minimizing variation in stochastic flow shop. 109-111
  Electronic Edition (link) BibTeX
• Jianjun Wen, Donglei Du:
  Preemptive on-line scheduling for two uniform processors. 113-116
  Electronic Edition (link) BibTeX
• Russell D. Meller, Venkat Narayanan, Pamela H. Vance:
  Optimal facility layout design. 117-127
  Electronic Edition (link) BibTeX
• Michael Sherman:
  Batch variance estimators for the median of simulation output. 129-134
  Electronic Edition (link) BibTeX
• Alper Sen, Ömer S. Benli:
  Lot streaming in open shops. 135-142
  Electronic Edition (link) BibTeX
• Tim Coelli:
  A multi-stage methodology for the solution of orientated DEA models. 143-149
  Electronic Edition (link) BibTeX
• Bingsheng He, Hai Yang:
  Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities. 151-161
  Electronic Edition (link) BibTeX
• Leonid Churilov, Daniel Ralph, Moshe Sniedovich:
  A note on composite concave quadratic programming. 163-169
  Electronic Edition (link) BibTeX
• Hong Chen, Hanqin Zhang:
  Diffusion approximations for Kumar-Seidman network under a priority service discipline. 171-181
  Electronic Edition (link) BibTeX