Operations Research Letters 27 (2000) 243}244
Author Index to Volume 27
The issue number is given in front of the page numbers
Aalto, S. and W.R.W. Scheinhardt, Tandem#uid queues fed by homogeneous on}o!
sources (2) 73} 82
Agnetis, A. and D. Pacciarelli, Part sequencing in three-machine no-wait robotic cells (4) 185}192 Ahn, S., G. Lee and J. Jeon, Analysis of the M/D/1-type queue based on an
integer-valued"rst-order autoregressive process (5) 235}241
Averbakh, I., Minmax regret solutions for minimax optimization problems with
uncer-tainty (2) 57} 65
Beck, A. and M. Teboulle, A probabilistic result for the max-cut problem on random
graphs (5) 209}214
Bosch, R.A., Maximum density stable patterns in variants of Conway's game of Life (1) 7} 11
CaHnovas, L., M. Landete and A. MarmHn, New facets for the set packing polytope (4) 153}161 CornueHjols, G. and L.F. Zuluaga, On Padberg's conjecture about almost totally
unim-odular matrices (3) 97} 99
Crema, A., An algorithm for the multiparametric 0}1-integer linear programming
problem relative to the constraint matrix (1) 13} 19
Czygrinow, A., Maximum dispersion problem in dense graphs (5) 223}227 Garcia, A. and R.L. Smith, Solving nonstationary in"nite horizon stochastic production
planning problems (3) 135}141
Gerodimos, A.E.,seeWagelmans, A.P.M. (3) 109}118
GuKrler, UG., M. Pmnar and M.M. Jelassi, On closed-form solutions of a resource allocation
problem in parallel funding of R&D projects (5) 229}234
Heemels, W.P.M.H., J.M. Schumacher and S. Weiland, Projected dynamical systems in
a complementarity formalism (2) 83} 91
Hoogeveen, H., C.N. Potts and G.J. Woeginger, On-line scheduling on a single machine:
maximizing the number of early jobs (5) 193}197
Jelassi, M.,seeGuKrler, UG. (5) 229}234
Jeon, J.,seeAhn, S. (5) 235}241
Johnson, E.L.,seeKlabjan, D. (2) 47} 55
Kallio, M. and S. Salo, An interior point method for solving systems of linear equations
and inequalities (3) 101}107
Klabjan, D., E.L. Johnson and G.L. Nemhauser, A parallel primal}dual simplex
algo-rithm (2) 47} 55
Landete, M.,seeCaHnovas, L. (4) 153}161
Lasserre, J.B., Why the logarithmic barrier function in convex and linear programming? (4) 149}152
Lee, G.,seeAhn, S. (5) 235}241
Elsevier Science B.V.
Lillo, R.E. and M. MartmHn, On optimal exhaustive policies for the M/G/1-queue (1) 39} 46 Litvinchev, I.S., On improved Choi}Goldfarb solution-containing ellipsoids in linear
programming (1) 29} 37
Mao, X.,seePiunovskiy, A.B. (3) 119}126
MarmHn, A.,seeCaHnovas, L. (4) 153}161
MartmHn, M.,seeLillo, R.E. (1) 39} 46
McCormick, S.T. and A. Shioura, Minimum ratio canceling is oracle polynomial for
linear programming, but not strongly polynomial, even for networks (5) 199}207
Nemhauser, G.L.,seeKlabjan, D. (2) 47} 55
Pacciarelli, D.,seeAgnetis, A. (4) 185}192
Padberg, M., Approximating separable nonlinear functions via mixed zero-one
pro-grams (1) 1} 5
Papachristos, S. and K. Skouri, An optimal replenishment policy for deteriorating items
with time-varying demand and partial}exponential type}backlogging (4) 175}184 Perry, D. and W. Stadje, Inventory systems for goods with censored random lifetimes (1) 21} 27 Perry, D., Control limit policies in a replacement model with additive phase-type
distributed damage and linear restoration (3) 127}134
Perry, D., W. Stadje and S. Zacks, Busy period analysis forM/G/1 andG/M/1 type
queues with restricted accessibility (4) 163}174
Pmnar, M.,seeGuKrler, UG. (5) 229}234
Piunovskiy, A.B. and X. Mao, Constrained Markovian decision processes: the dynamic
programming approach (3) 119}126
Potts, C.N.,seeHoogeveen, H. (5) 193}197
Salo, S.,seeKallio, M. (3) 101}107
Scheinhardt,W.R.W.,seeAalto, S. (2) 73} 82
Schumacher, J.M.,seeHeemels, W.P.M.H. (2) 83} 91
Seiden, S., J. Sgall and G. Woeginger, Semi-online scheduling with decreasing job sizes (5) 215}221
Sgall, J.,seeSeiden, S. (5) 215}221
Shioura, A.,seeMcCormick, S.T. (5) 199}207
Skouri, K.,seePapachristos, S. (4) 175}184
Smith, R.L.,seeGarcia, A. (3) 135}141
Stadje, W.,seePerry, D. (1) 21} 27
Stadje, W.,seePerry, D. (4) 163}174
Teboulle, M.,seeBeck, A. (5) 209}214
Vanderperre, E.J., A Sokhotski}Plemelj problem related to a robot-safety device system (2) 67} 71 Wagelmans, A.P.M. and A.E. Gerodimos, Improved dynamic programs for some
batch-ing problems involvbatch-ing the maximum lateness criterion (3) 109}118
Wagner, D.K., Shortest paths in almost acyclic graphs (4) 143}147
Weiland, S.,seeHeemels, W.P.M.H. (2) 83} 91
Woeginger, G.,seeSeiden, S. (5) 215}221
Woeginger, G.J., Monge strikes again: optimal placement of web proxies in the internet (3) 93} 96
Woeginger, G.J.,seeHoogeveen, H. (5) 193}197
Zacks, S.,seePerry, D. (4) 163}174
Zuluaga, L.F.,seeCornueHjols, G. (3) 97} 99
