External Links

    Journal: Oper. Res. Lett.

    Volume 26, Issue 5

    201 -- 209Attila Csenki. Asymptotics for renewal-reward processes with retrospective reward structure
    211 -- 216Henrique Pacca Loureiro Luna, P. Mahey. Bounds for global optimization of capacity expansion and flow assignment problems
    217 -- 222Guochuan Zhang, Xiaoqiang Cai, C. K. Wong. Linear time-approximation algorithms for bin packing
    223 -- 229T. C. Edwin Cheng, Guoqing Wang. An improved heuristic for two-machine flowshop scheduling with an availability constraint
    231 -- 235Shen Zheng, Andrew F. Seila. Some well-behaved estimators for the M/M/1 queue
    237 -- 245Lars Thorlund-Petersen. Comparison of probability measures: Dominance of the third degree

    Volume 26, Issue 4

    149 -- 154Michel X. Goemans, Joel Wein, David P. Williamson. A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
    155 -- 158Henk C. Tijms, R. Veldman. A fast algorithm for the transient reward distribution in continuous-time Markov chains
    159 -- 163Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum. Linear-shaped partition problems
    165 -- 173Jeffrey B. Sidney, Chris N. Potts, Chelliah Sriskandarajah. A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
    175 -- 179Christos Koulamas, George J. Kyparisis. Scheduling on uniform parallel machines to minimize maximum lateness
    181 -- 192Vitaly A. Strusevich. Group technology approach to the open shop scheduling problem with batch setup times
    193 -- 197Maxim Sviridenko. Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem

    Volume 26, Issue 3

    99 -- 105Francisco Barahona. On the ::::k::::-cut problem
    107 -- 109Gerhard J. Woeginger. A comment on scheduling on uniform machines under chain-type precedence constraints
    111 -- 116Emily Larson Luebke, J. Scott Provan. On the structure and complexity of the 2-connected Steiner network problem in the plane
    117 -- 126Gerald G. Brown, Robert F. Dell, Michael P. Olson. Valid integer polytope (VIP) penalties for branch-and-bound enumeration
    127 -- 136L. Grippo, M. Sciandrone. On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
    137 -- 147David Perry, Morton J. M. Posner. A correlated M/G/1-type queue with randomized server repair and maintenance modes

    Volume 26, Issue 2

    49 -- 54Allen G. Holder, Richard J. Caron. Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
    55 -- 66Michael M. Güntzer, Dieter Jungnickel. Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem
    67 -- 80Qi-Ming He. Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models
    81 -- 89Susan M. Sanchez, Prabhudev Konana. Efficient data allocation for frequency domain experiments
    91 -- 98Ruud H. Teunter, Edo S. Van der Poort. The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges

    Volume 26, Issue 1

    1 -- 8Hanif D. Sherali, Gyunghyun Choi, Cihan H. Tuncbilek. A variable target value method for nondifferentiable optimization
    9 -- 16Y. Salama. Optimal control of a simple manufacturing system with restarting costs
    17 -- 22Leah Epstein, Jiri Sgall. A lower bound for on-line scheduling on uniformly related machines
    23 -- 26Julián Aráoz. Forward chaining is simple(::::x::::)
    27 -- 32Gianpaolo Ghiani, Gennaro Improta. An algorithm for the hierarchical Chinese postman problem
    33 -- 41Siriphong Lawphongpanich. Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
    43 -- 47Alfred Müller. On the waiting times in queues with dependency between interarrival and service times
    runs on