Operations Research Letters, Volume 22

Volume 22, Number 1, February 1998

• Anuj Mehrotra, Michael A. Trick:
  Cliques and clustering: A combinatorial approach. 1-12
  Electronic Edition (link) BibTeX
• Vladimir G. Deineko, Gerhard J. Woeginger:
  A solvable case of the quadratic assignment problem. 13-17
  Electronic Edition (link) BibTeX
• Kamlesh Mathur:
  An integer-programming-based heuristic for the balanced loading problem. 19-25
  Electronic Edition (link) BibTeX
• Gordon E. Willmot:
  On a class of approximations for ruin and waiting time probabilities. 27-32
  Electronic Edition (link) BibTeX
• J. David Fuller, Frederic H. Murphy:
  On the convergence of the decoupling algorithm for multiperiod equilibrium models. 33-39
  Electronic Edition (link) BibTeX
• DaeSoo Kim, Won J. Lee:
  Optimal coordination strategies for production and marketing decisions. 41-47
  Electronic Edition (link) BibTeX
• Geir Dahl:
  Polytopes related to the l_infinity-distance between vectors. 49-54
  Electronic Edition (link) BibTeX

Volume 22, Numbers 2-3, 1 March 1998

• Pierre Hansen, Nenad Mladenovic, Éric D. Taillard:
  Heuristic solution of the multisource Weber problem as a p-median problem. 55-62
  Electronic Edition (link) BibTeX
• Avital Lann, Gur Mosheiov, Yosef Rinott:
  Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps. 63-68
  Electronic Edition (link) BibTeX
• Fred J. Rispoli:
  The monotonic diameter of traveling salesman polytopes. 69-73
  Electronic Edition (link) BibTeX
• Guo-Hui Lin, En-Yu Yao, Yong He:
  Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times. 75-81
  Electronic Edition (link) BibTeX
• Michael Jünger, Stefan Thienel:
  Introduction to ABACUS - a branch-and-cut system. 83-95
  Electronic Edition (link) BibTeX
• Ubaldo M. García-Palomares:
  A superlinearly convergent projection algorithm for solving the convex inequality problem. 97-103
  Electronic Edition (link) BibTeX
• Andrew Lim:
  The berth planning problem. 105-110
  Electronic Edition (link) BibTeX

Volume 22, Numbers 4-5, 1 May 1998

• Fabián A. Chudak, Michel X. Goemans, Dorit S. Hochbaum, David P. Williamson:
  A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. 111-118
  Electronic Edition (link) BibTeX
• Bettina Klinz, Gerhard J. Woeginger:
  One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs. 119-127
  Electronic Edition (link) BibTeX
• Michel Balinski, Niousha Shahidi:
  A simple approach to the product rate variation problem via axiomatics. 129-135
  Electronic Edition (link) BibTeX
• Satoru Iwata, Tomomi Matsui, S. Thomas McCormick:
  A fast bipartite network flow algorithm for selective assembly. 137-143
  Electronic Edition (link) BibTeX
• Jos F. Sturm, Shuzhong Zhang:
  On the long-step path-following method for semidefinite programming. 145-150
  Electronic Edition (link) BibTeX
• Jack Brimberg, Reuven Chen, Doron Chen:
  Accelerating convergence in the Fermat-Weber location problem. 151-157
  Electronic Edition (link) BibTeX
• Jonathan Barzilai:
  On the decomposition of value functions. 159-170
  Electronic Edition (link) BibTeX
• Steven S. Seiden:
  Randomized online interval scheduling. 171-177
  Electronic Edition (link) BibTeX
• Matthieu van der Heijden, Ton G. de Kok:
  Estimating stock levels in periodic review inventory systems. 179-182
  Electronic Edition (link) BibTeX