Volume 5, Number 1, February 2008
: Fair cost allocations under conflicts - a game-theoretic point of view - .
, Michal Penn
: Approximation algorithm for minimizing total latency in machine scheduling with deliveries.
Kevin K. H. Cheung
: Solving mirrored traveling tournament problem benchmark instances with eight teams.
Volume 5, Number 2, May 2008
Kenneth J. Arrow
: George Dantzig in the development of economic analysis.
Richard M. Karp
: George Dantzig's impact on the theory of computation.
, Lorenz T. Biegler
, Andrew R. Conn
, Gérard Cornuéjols
, Ignacio E. Grossmann
, Carl D. Laird
, Jon Lee
, Andrea Lodi
, François Margot
, Nicolas W. Sawaya
, Andreas Wächter
: An algorithmic framework for convex mixed integer nonlinear programs.
, Kevin Hooker
: Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes.
Hanif D. Sherali
, Fred Glover
: Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities.
: A pricing problem under Monge property.
, Deepak Rajan
: Partition inequalities for capacitated survivable network design based on directed p-cycles.
Volume 5, Number 3, August 2008
: Dominance guarantees for above-average solutions.
, Andrea Santori
: New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability.
Volume 5, Number 4, November 2008
, Frank K. Hwang
: A new construction of I-separable matrices via an improved decoding of Macula's construction.
, Mhand Hifi
: Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem.