RAIRO - Operations Research
Volume 41 / No 3 (July-September 2007)
Journées Polyèdres et Optimisation Combinatoire
A branch-and-cut algorithm for a resource-constrained scheduling problem p. 235
Published online: 21 August 2007
On the minimum cost multiple-source unsplittable flow problem p. 253
Published online: 21 August 2007
Clique partitioning of interval graphs with submodular costs on the cliques p. 275
Published online: 21 August 2007
A note on the Chvátal-rank of clique family inequalities p. 289
Published online: 21 August 2007
On co-bicliques p. 295
Published online: 21 August 2007
Approximation algorithms for metric tree cover and generalized tour and tree covers p. 305
Published online: 21 August 2007
The Polytope of m-Subspaces of a Finite Affine Space p. 317
Published online: 21 August 2007