Journal: Oper. Res. Lett.

Volume 20, Issue 5

199 -- 206Joseph Abate, Ward Whitt. Limits and approximations for the M/G/1 LIFO waiting-time distribution
207 -- 212Thomas Tautenhahn, Gerhard J. Woeginger. Minimizing the total completion time in a unit-time open shop with release times
213 -- 221Etienne de Klerk, Cornelis Roos, Tamás Terlaky. Initialization in semidefinite programming via a self-dual skew-symmetric embedding
223 -- 228Liqun Qi. On superlinear convergence of quasi-Newton methods for nonsmooth equations
229 -- 235Wolfgang Stadje. Asymptotic normality of discounted random series with applications in reliability and queueing
237 -- 242Yishay Spector, Dror Zuckerman. Expenditure patterns and timing of patent protection in a competitive R&D environment
243 -- 247Raymond G. Vickson. On the probability distribution of total quality under sublot inspection and process restoration

Volume 20, Issue 4

149 -- 154Gerhard J. Woeginger. A polynomial-time approximation scheme for maximizing the minimum machine completion time
155 -- 164Charles R. Sox. Dynamic lot sizing with random demand and non-stationary costs
165 -- 169Horst W. Hamacher, Anita Schöbel. A note on center problems with forbidden polyhedra
171 -- 177Aiping Liao. Modifying the BFGS method
179 -- 185Roberto Cominetti, Christian Michelot. 1 multifacility location problems
187 -- 194Eitan Altman, Serguei Foss. Polling on a space with general arrival and service time distribution
195 -- 198Ernesto de Queirós Vieira Martins, José Luis Esteves dos Santos. An algorithm for the quickest path problem

Volume 20, Issue 3

101 -- 108Ravindra K. Ahuja, James B. Orlin. Equivalence of the primal and dual simplex algorithms for the maximum flow problem
109 -- 118Barry L. Nelson, Bruce W. Schmeiser, Michael R. Taaffe, Jin Wang. Approximation-assisted point estimation
119 -- 127Edward P. K. Tsang, Christos Voudouris. Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
129 -- 139Chung-Yee Lee. Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
141 -- 148Takahito Kuno, Takahiro Utsunomiya. Minimizing a linear multiplicative-type function under network flow constraints

Volume 20, Issue 2

51 -- 57Kurt M. Bretthauer, Bala Shetty. Quadratic resource allocation with generalized upper bounds
59 -- 63E. Andrew Boyd. A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball
65 -- 74S. T. Webster. The complexity of scheduling job families about a common due date
75 -- 79Mikhail Y. Kovalyov, Frank Werner. max
81 -- 84J. Scott Provan. On finding two-connected subgraphs in planar graphs
85 -- 92Christian Kanzow. A new approach to continuation methods for complementarity problems with uniform P-functions
93 -- 100Guntram Scheithauer, Johannes Terno. Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem

Volume 20, Issue 1

1 -- 6Jean-Louis Goffin, Patrice Marcotte, Daoli Zhu. An analytic center cutting plane method for pseudomonotone variational inequalities
7 -- 13C. A. van Eijl, C. P. M. van Hoesel. On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
15 -- 20Hans van Maaren, Tamás Terlaky. Inverse barriers and CES-functions in linear programming
21 -- 29Jean-Marie Bourjolly, Gilbert Laporte, Hélène Mercure. A combinatorial column generation algorithm for the maximum stable set problem
31 -- 38Weixiong Zhang. A note on the complexity of the asymmetric traveling salesman problem
39 -- 44Abdelaziz Foul. A characterization of an n by 2n "Q0"-matrix
45 -- 50Konstantinos Dosios, Konstantinos Paparrizos. Resolution of the problem of degeneracy in a primal and dual simplex algorithm