Journal: Oper. Res. Lett.

Volume 31, Issue 1

1 -- 6Wolfgang Stadje. Renewal analysis of a replacement process
7 -- 11Mark Voorneveld. Characterization of Pareto dominance
12 -- 20Tobias Polzin, Siavash Vahdati Daneshmand. On Steiner trees and minimum spanning trees in hypergraphs
21 -- 27Marie-Christine Costa, Lucas Létocart, Frédéric Roupin. A greedy algorithm for multicut and integral multiflow in rooted trees
28 -- 34Tjark Vredeveld, Jan Karel Lenstra. On local search for the generalized graph coloring problem
35 -- 41Hans Kellerer, Vladimir Kotov. An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
42 -- 48Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng. On scheduling an unbounded batch machine
49 -- 52Mohamed Haouari, Anis Gharbi. An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
53 -- 59Stefan Chanas, Pawel Zielinski. On the hardness of evaluating criticality of activities in a planar network with duration intervals
60 -- 62Rafael Herrerías Pleguezuelo, José García Pérez, Salvador Cruz Rambaud. A note on the reasonableness of PERT hypotheses
63 -- 65Steven A. Lippman, Kevin F. McCardle. Comparative statics of cell phone plans
66 -- 76Huseyin Topaloglu, Warren B. Powell. An algorithm for approximating piecewise linear concave functions from sample gradients
77 -- 82Torpong Cheevaprawatdomrong, Robert L. Smith. A paradox in equipment replacement under technological improvement