External Links

    Journal: Oper. Res. Lett.

    Volume 15, Issue 5

    223 -- 230Joseph Abate, Ward Whitt. A heavy-traffic expansion for asymptotic decay rates of tail probabilities in multichannel queues
    231 -- 236Herwig Bruneel, Ilse Wuyts. Analysis of discrete-time multiserver queueing models with constant service times
    237 -- 239Eui Yong Lee, Jiyeon Lee. Optimal control of a model for a system subject to random shocks
    241 -- 251Michael C. Fu, Jian-Qiang Hu. Smoothed perturbation analysis derivative estimation for Markov chains
    253 -- 263C. Gary Rommel. X/G/1-PS process response time
    265 -- 272Gilles Savard, Jacques Gauvin. The steepest descent direction for the nonlinear bilevel programming problem
    273 -- 282Mary A. Johnson, Sanghoon Lee 0004, James R. Wilson. NPPMLE and NPPSIM: Software for estimating and simulating nonhomogeneous Poisson processes having cyclic behavior

    Volume 15, Issue 4

    169 -- 178Robert E. Bixby, Matthew J. Saltzman. Recovering an optimal LP basis from an interior point solution
    179 -- 185Harvey J. Greenberg. The use of the optimal partition in a linear programming solution for postoptimal analysis
    187 -- 192O. L. Mangasarian. Error bounds for inconsistent linear inequalities and programs
    193 -- 194Tung-Yang Ho, Lih-Hsing Hsu. A note on the minimum cut cover of graphs
    195 -- 203Surya D. Liman, Sanjay Ramaswamy. Earliness-tardiness scheduling problems with a common delivery window
    205 -- 211Michael X. Weng, Jose A. Ventura. A quadratic integer programming method for minimizing the mean squared deviation of completion times
    213 -- 222Ching-Jong Liao, Wen-Hwa Yang. An inventory system with multiple replenishment scheduling

    Volume 15, Issue 3

    115 -- 126Martine Labbé, Edward F. Schmeichel, S. Louis Hakimi. Approximation algorithms for the capacitated plant allocation problem
    127 -- 131F. Bruce Shepherd. A note on clutter partitions
    133 -- 141Michael R. Bussieck, Hannes Hassler, Gerhard J. Woeginger, Uwe T. Zimmermann. Fast algorithms for the maximum convolution problem
    143 -- 149Marie-Christine Costa. Persistency in maximum cardinality bipartite matchings
    151 -- 156S. Rajagopalan. Two commodity flows
    157 -- 161Manoj K. Chari. On reversible semi-Markov processes
    163 -- 168D. Deivamoney Selvam, V. Sivasankaran. A two-phase queueing system with server vacations

    Volume 15, Issue 2

    59 -- 71Zonghao Gu, Ellis L. Johnson, George L. Nemhauser, Wang Yinhua. Some properties of the fleet assignment problem
    73 -- 79Thai Quynh Phong. An algorithm for solving general D.C. programming problems
    81 -- 83Giovanni Andreatta, F. M. Mason. A note on "A perfect forward procedure for a single facility dynamic location/relocation problem"
    85 -- 93Jing-Sheng Song. Understanding the lead-time effects in stochastic inventory systems with discounted costs
    95 -- 104Dooyeong Park, Harry G. Perros, Hideaki Yamashita. Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss
    105 -- 114Teresa León, Enriqueta Vercher. New descent rules for solving the linear semi-infinite programming problem

    Volume 15, Issue 1

    1 -- 9F. P. Kelly. On tariffs, policing and admission control for multiservice networks
    11 -- 17Yixin Zhu. Markovian queueing networks in a random environment
    19 -- 33Elena Fernández, Kurt Jørnsten. Partial cover and complete cover inequalities
    35 -- 40Jen-Chih Yao. Existence of generalized variational inequalities
    41 -- 46Joy Kuri, Anurag Kumar 0001. On the optimal allocation of customers that must depart in sequence
    47 -- 58George L. Nemhauser, Martin W. P. Savelsbergh, Gabriele Sigismondi. MINTO, a mixed INTeger optimizer
    runs on