


default search action
Operations Research Letters, Volume 25
Volume 25, Number 1, August 1999
- Aharon Ben-Tal, Arkadi Nemirovski
:
Robust solutions of uncertain linear programs. 1-13 - Virginie Gabrel, Arnaud Knippel
, Michel Minoux:
Exact solution of multicommodity network optimization problems with general step cost functions. 15-23 - Joseph Abate, Ward Whitt:
Explicit M/G/1 waiting-time distributions for a class of long-tail service-time distributions. 25-31 - Carlo Filippi
:
A reverse search algorithm for the neighborhood problem. 33-37 - Csaba Mészáros:
Steplengths in interior-point algorithms of quadratic programming. 39-45 - Gerhard J. Woeginger, Guochuan Zhang
:
Optimal on-line algorithms for variable-sized bin covering. 47-50
Volume 25, Number 2, September 1999
- Fangruo Chen:
Worst-case analysis of (R, Q) policies in a two-stage serial inventory system with deterministic demand and backlogging. 51-58 - Sy-Ming Guu:
Properties of the multiple lot-sizing problem with rigid demand, general cost structures, and interrupted geometric yield. 59-65 - Masaaki Kijima, Tetsu Takimoto:
A (T, S) inventory/production system with limited production capacity and uncertain demands. 67-79 - Agostinho Agra
, Miguel Fragoso Constantino:
Lotsizing with backlogging and start-ups: the case of Wagner-Whitin costs. 81-88 - Duan Li
:
Zero duality gap in integer programming: P-norm surrogate constraint method. 89-96 - Geir Dahl
:
Notes on polyhedra associated with hop-constrained paths. 97-100 - Fen-Hui Lin, Way Kuo
, Frank Hwang:
Structure importance of consecutive-k-out-of-n systems. 101-107
Volume 25, Number 3, October 1999
- Edward G. Coffman Jr., Predrag R. Jelenkovic:
Performance of the move-to-front algorithm with Markov-modulated request sequences. 109-118 - Mauro Dell'Amico, Martine Labbé, Francesco Maffioli:
Exact solution of the SONET Ring Loading Problem. 119-129 - Thomas Bonald, Douglas G. Down:
Stability of mixed generalized Jackson networks. 131-136 - Dragomir D. Dimitrijevic:
A solution to mean delay in the SigmaMc/Gck/1 cyclic priority queue with cycle (k) and class (c) dependent feedback and service times. 137-145 - Eui Yong Lee, Jiyeon Lee:
An optimal proportion of perfect repair. 147-148
Volume 25, Number 4, November 1999
- Jing Hu, Ellis L. Johnson:
Computational results with a primal-dual subproblem simplex method. 149-157 - Michael Patriksson
, Laura Wynter:
Stochastic mathematical programs with equilibrium constraints. 159-167 - Toshihiro Fujito:
On approximation of the submodular set cover problem. 169-174 - Vittorio Maniezzo
, Aristide Mingozzi:
The project scheduling problem with irregular starting time costs. 175-182 - Cornelis Roos, Tamás Terlaky
:
Note on a paper of Broyden. 183-186 - John Preater:
The best-choice problem for partially ordered objects. 187-190 - J. Ben Atkinson:
On some parallels between the loss probability in the GI/G/1 loss system and the delay probability in the GI/G/1 queue. 191-194 - Michael K. Ng
:
A note on policy algorithms for discounted Markov decision problems. 195-197
Volume 25, Number 5, December 1999
- Fabián A. Chudak, Dorit S. Hochbaum:
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. 199-204 - Donald Goldfarb, Zhiying Jin:
A new scaling algorithm for the minimum cost network flow problem. 205-211 - Tugrul Sanli, Vidyadhar G. Kulkarni:
Optimal admission to reader-writer systems with no queueing. 213-218 - Richard Loulou, Amit Kanudia:
Minimax regret strategies for greenhouse gas abatement: methodology and application. 219-230 - Yunbin Zhao:
Existence of a solution to nonlinear variational inequality under generalized positive homogeneity. 231-239 - P. Vijaya Laxmi, U. C. Gupta:
On the finite-buffer bulk-service queue with general independent arrivals: GI/M[b]/1/N. 241-245

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.