Journal: Oper. Res. Lett.

Volume 17, Issue 5

201 -- 204David Hartvigsen, François Margot. Multiterminal flows and cuts
205 -- 208J. A. Hoogeveen, Steef L. van de Velde. Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
209 -- 214Stephen A. Vavasis, Yinyu Ye. Condition numbers for polyhedra with real number data
215 -- 220Thai Quynh Phong, Le Thi Hoai An, Pham Dinh Tao. Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
221 -- 229S. Chang, Q. Lu, G. Tang, W. Yu. On decomposition of the total tardiness problem
231 -- 236Mehran Hojati. The network synthesis problem in a cycle
237 -- 242Xiuli Chao, Michael Pinedo. Networks of queues with batch services, signals and product form solutions
243 -- 249T. C. Edwin Cheng, Mikhail Y. Kovalyov. Single machine batch scheduling with deadlines and resource dependent processing times

Volume 17, Issue 4

153 -- 157Frank K. Hwang, Uriel G. Rothblum. Assembly at system level versus component level
159 -- 164Hamilton Emmons, Kamlesh Mathur. Lot sizing in a no-wait flow shop
165 -- 174Douglas J. Morrice. A comparison of frequency domain methodology and conventional factor screening methods
175 -- 180William R. Allen. An improved bound for the multifacility location model
181 -- 190Xiaojie Xu, Yinyu Ye. A generalized homogeneous and self-dual algorithm for linear programming
191 -- 199Jesus R. Artalejo. A queueing system with returning customers and waiting line

Volume 17, Issue 3

103 -- 110Dorit S. Hochbaum. A nonlinear Knapsack problem
111 -- 119Dimitri P. Bertsekas. Generic rank-one corrections for value iteration in Markovian decision problems
121 -- 126Ulf Brännlund, Krzysztof C. Kiwiel, Per Olov Lindberg. A descent proximal level bundle method for convex nondifferentiable optimization
127 -- 129Zhi-Long Chen. A note on single-processor scheduling with time-dependent execution times
131 -- 137Francisco Facchinei. 1 functions and the Maratos effect
139 -- 147Sheldon H. Jacobson. How difficult is the frequency selection problem?
149 -- 152Jose A. Ventura, Michael X. Weng. An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date

Volume 17, Issue 2

53 -- 56Rainer E. Burkard. On the role of bottleneck Monge matrices in combinatorial optimization
57 -- 68Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee. Minimizing the error bound for the dynamic lot size model
69 -- 76I. Z. Milis, V. F. Magirou. A Lagrangian relaxation algorithm for sparse quadratic assignment problems
77 -- 84Michael A. Zazanis. Derivative estimation via stochastic intensities: Event averages in queueing systems
85 -- 87Mikhail Y. Kovalyov. Improving the complexities of approximation algorithms for optimization problems
89 -- 101Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma. NETPAD: An interactive graphics system for network modeling and optimization

Volume 17, Issue 1

1 -- 7Michael O. Ball, Feng L. Lin. Reliability, covering and balanced matrices
9 -- 18Martine Labbé, Gilbert Laporte, Silvano Martello. An exact algorithm for the dual bin packing problem
19 -- 26Hanif D. Sherali, Youngho Lee, Warren P. Adams. A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
27 -- 36Ariel Orda, Raphael Rom. On continuous network flows
37 -- 40Bengt Aspvall, Sjur Didrik Flåm, Kåre Villanger. Selecting among scheduled projects
41 -- 45Refael Hassin, Moshe Haviv. Equilibrium strategies for queues with impatient customers
47 -- 51Xiuli Chao. Monotone effect of dependency between interarrival and service times in a simple queueing system