Journal: Oper. Res. Lett.

Volume 27, Issue 5

193 -- 197Han Hoogeveen, Chris N. Potts, Gerhard J. Woeginger. On-line scheduling on a single machine: maximizing the number of early jobs
199 -- 207S. Thomas McCormick, Akiyoshi Shioura. Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
209 -- 214Amir Beck, Marc Teboulle. A probabilistic result for the max-cut problem on random graphs
215 -- 221Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger. Semi-online scheduling with decreasing job sizes
223 -- 227Andrzej Czygrinow. Maximum dispersion problem in dense graphs
229 -- 234Ülkü Gürler, Mustafa Ç. Pinar, Mohamed Mehdi Jelassi. On closed-form solutions of a resource allocation problem in parallel funding of R&D projects
235 -- 241Soohan Ahn, Gyemin Lee, Jongwoo Jeon. Analysis of the M/D/1-type queue based on an integer-valued first-order autoregressive process

Volume 27, Issue 4

143 -- 147Donald K. Wagner. Shortest paths in almost acyclic graphs
149 -- 152Jean B. Lasserre. Why the logarithmic barrier function in convex and linear programming?
153 -- 161Lázaro Cánovas, Mercedes Landete, Alfredo Marín. New facets for the set packing polytope
163 -- 174David Perry, Wolfgang Stadje, S. Zacks. Busy period analysis for ::::M::::/::::G::::/1 and ::::G::::/::::M::::/1 type queues with restricted accessibility
175 -- 184S. Papachristos, K. Skouri. An optimal replenishment policy for deteriorating items with time-varying demand and partial-exponential type - backlogging
185 -- 192Alessandro Agnetis, Dario Pacciarelli. Part sequencing in three-machine no-wait robotic cells

Volume 27, Issue 3

93 -- 96Gerhard J. Woeginger. Monge strikes again: optimal placement of web proxies in the internet
97 -- 99Gérard Cornuéjols, Luis F. Zuluaga. On Padberg s conjecture about almost totally unimodular matrices
101 -- 107Markku Kallio, Seppo Salo. An interior point method for solving systems of linear equations and inequalities
109 -- 118Albert P. M. Wagelmans, A. E. Gerodimos. Improved dynamic programs for some batching problems involving the maximum lateness criterion
119 -- 126Alexei B. Piunovskiy, X. Mao. Constrained Markovian decision processes: the dynamic programming approach
127 -- 134David Perry. Control limit policies in a replacement model with additive phase-type distributed damage and linear restoration
135 -- 141Alfredo García, Robert L. Smith. Solving nonstationary infinite horizon stochastic production planning problems

Volume 27, Issue 2

47 -- 55Diego Klabjan, Ellis L. Johnson, George L. Nemhauser. A parallel primal-dual simplex algorithm
57 -- 65Igor Averbakh. Minmax regret solutions for minimax optimization problems with uncertainty
67 -- 71Edmond J. Vanderperre. A Sokhotski-Plemelj problem related to a robot-safety device system
73 -- 82Samuli Aalto, Werner R. W. Scheinhardt. Tandem fluid queues fed by homogeneous on-off sources
83 -- 91W. P. M. H. Heemels, J. M. Schumacher, Siep Weiland. Projected dynamical systems in a complementarity formalism

Volume 27, Issue 1

1 -- 5Manfred Padberg. Approximating separable nonlinear functions via mixed zero-one programs
7 -- 11Robert A. Bosch. Maximum density stable patterns in variants of Conway s game of Life
13 -- 19Alejandro Crema. An algorithm for the multiparametric 0-1-integer linear programming problem relative to the constraint matrix
21 -- 27David Perry, Wolfgang Stadje. Inventory systems for goods with censored random lifetimes
29 -- 37Igor S. Litvinchev. On improved Choi-Goldfarb solution-containing ellipsoids in linear programming
39 -- 46R. E. Lillo, M. Martín. On optimal exhaustive policies for the M/G/1-queue