Journal: Oper. Res. Lett.

Volume 23, Issue 3-5

71 -- 80Lisa Fleischer, Éva Tardos. Efficient continuous-time dynamic network flow algorithms
81 -- 88Joost P. Warners, Hans van Maaren. A two-phase algorithm for solving a class of hard satisfiability problems
89 -- 97Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen. The partial constraint satisfaction problem: Facets and lifting theorems
99 -- 107Alessandra Esposito, M. S. Fiorenzo Catalano, F. Malucelli, Luciano Tarricone. A new matrix bandwidth reduction algorithm
109 -- 111Chunfu Jia. Minimizing variation in stochastic flow shop
113 -- 116Jianjun Wen, Donglei Du. Preemptive on-line scheduling for two uniform processors
117 -- 127Russell D. Meller, Venkat Narayanan, Pamela H. Vance. Optimal facility layout design
129 -- 134Michael Sherman. Batch variance estimators for the median of simulation output
135 -- 142Alper Sen, Ömer S. Benli. Lot streaming in open shops
143 -- 149Tim Coelli. A multi-stage methodology for the solution of orientated DEA models
151 -- 161Bingsheng He, Hai Yang. Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
163 -- 169Leonid Churilov, Daniel Ralph, Moshe Sniedovich. A note on composite concave quadratic programming
171 -- 181Hong Chen, Hanqin Zhang. Diffusion approximations for Kumar-Seidman network under a priority service discipline

Volume 23, Issue 1-2

1 -- 7Nilotpal Chakravarti, Albert P. M. Wagelmans. Calculation of stability radii for combinatorial optimization problems
9 -- 11Petra Schuurman. A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
13 -- 19Eddie Cheng. Separating subdivision of bicycle wheel inequalities over cut polytopes
21 -- 26Geir Dahl. The 2-hop spanning tree problem
27 -- 33P. T. Sokkalingam, Y. P. Aneja. Lexicographic bottleneck combinatorial problems
35 -- 40Diego Klabjan, George L. Nemhauser, C. Tovey. The complexity of cover inequality separation
41 -- 43Gerhard J. Woeginger. A comment on a minmax location problem
45 -- 51Christian Kanzow, Masao Fukushima. Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
53 -- 61Jianmin Jiang. A long-step primal-dual path-following method for semidefinite programming
63 -- 70Wheyming Tina Song, Chien-Chou Su. A three-class variance swapping technique for simulation experiments