Operations Research Letters, Volume 26

Volume 26, Number 1, February 2000

• Hanif D. Sherali, Gyunghyun Choi, Cihan H. Tuncbilek:
  A variable target value method for nondifferentiable optimization. 1-8
  Electronic Edition (link) BibTeX
• Y. Salama:
  Optimal control of a simple manufacturing system with restarting costs. 9-16
  Electronic Edition (link) BibTeX
• Leah Epstein, Jiri Sgall:
  A lower bound for on-line scheduling on uniformly related machines. 17-22
  Electronic Edition (link) BibTeX
• Julián Aráoz:
  Forward chaining is simple(x). 23-26
  Electronic Edition (link) BibTeX
• Gianpaolo Ghiani, Gennaro Improta:
  An algorithm for the hierarchical Chinese postman problem. 27-32
  Electronic Edition (link) BibTeX
• Siriphong Lawphongpanich:
  Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints. 33-41
  Electronic Edition (link) BibTeX
• Alfred Müller:
  On the waiting times in queues with dependency between interarrival and service times. 43-47
  Electronic Edition (link) BibTeX

Volume 26, Number 2, March 2000

• Allen G. Holder, Richard J. Caron:
  Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights. 49-54
  Electronic Edition (link) BibTeX
• Michael M. Güntzer, Dieter Jungnickel:
  Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem. 55-66
  Electronic Edition (link) BibTeX
• Qi-Ming He:
  Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models. 67-80
  Electronic Edition (link) BibTeX
• Susan M. Sanchez, Prabhudev Konana:
  Efficient data allocation for frequency domain experiments. 81-89
  Electronic Edition (link) BibTeX
• Ruud H. Teunter, Edo S. Van der Poort:
  The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges. 91-98
  Electronic Edition (link) BibTeX

Volume 26, Number 3, April 2000

• Francisco Barahona:
  On the k-cut problem. 99-105
  Electronic Edition (link) BibTeX
• Gerhard J. Woeginger:
  A comment on scheduling on uniform machines under chain-type precedence constraints. 107-109
  Electronic Edition (link) BibTeX
• Emily Larson Luebke, J. Scott Provan:
  On the structure and complexity of the 2-connected Steiner network problem in the plane. 111-116
  Electronic Edition (link) BibTeX
• Gerald G. Brown, Robert F. Dell, Michael P. Olson:
  Valid integer polytope (VIP) penalties for branch-and-bound enumeration. 117-126
  Electronic Edition (link) BibTeX
• L. Grippo, M. Sciandrone:
  On the convergence of the block nonlinear Gauss-Seidel method under convex constraints. 127-136
  Electronic Edition (link) BibTeX
• David Perry, Morton J. M. Posner:
  A correlated M/G/1-type queue with randomized server repair and maintenance modes. 137-147
  Electronic Edition (link) BibTeX

Volume 26, Number 4, May 2000

• Michel X. Goemans, Joel Wein, David P. Williamson:
  A 1.47-approximation algorithm for a preemptive single-machine scheduling problem. 149-154
  Electronic Edition (link) BibTeX
• Henk C. Tijms, R. Veldman:
  A fast algorithm for the transient reward distribution in continuous-time Markov chains. 155-158
  Electronic Edition (link) BibTeX
• Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum:
  Linear-shaped partition problems. 159-163
  Electronic Edition (link) BibTeX
• Jeffrey B. Sidney, Chris N. Potts, Chelliah Sriskandarajah:
  A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups. 165-173
  Electronic Edition (link) BibTeX
• Christos Koulamas, George J. Kyparisis:
  Scheduling on uniform parallel machines to minimize maximum lateness. 175-179
  Electronic Edition (link) BibTeX
• Vitaly A. Strusevich:
  Group technology approach to the open shop scheduling problem with batch setup times. 181-192
  Electronic Edition (link) BibTeX
• Maxim Sviridenko:
  Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem. 193-197
  Electronic Edition (link) BibTeX

Volume 26, Number 5, June 2000

• Attila Csenki:
  Asymptotics for renewal-reward processes with retrospective reward structure. 201-209
  Electronic Edition (link) BibTeX
• Henrique Pacca Loureiro Luna, P. Mahey:
  Bounds for global optimization of capacity expansion and flow assignment problems. 211-216
  Electronic Edition (link) BibTeX
• Guochuan Zhang, Xiaoqiang Cai, C. K. Wong:
  Linear time-approximation algorithms for bin packing. 217-222
  Electronic Edition (link) BibTeX
• T. C. Edwin Cheng, Guoqing Wang:
  An improved heuristic for two-machine flowshop scheduling with an availability constraint. 223-229
  Electronic Edition (link) BibTeX
• Shen Zheng, Andrew F. Seila:
  Some well-behaved estimators for the M/M/1 queue. 231-235
  Electronic Edition (link) BibTeX
• Lars Thorlund-Petersen:
  Comparison of probability measures: Dominance of the third degree. 237-245
  Electronic Edition (link) BibTeX