Operations Research

Vol. 41 No. 3 (July-September 2007)

Special Issue: Journées Polyèdres et Optimisation Combinatoire

• Editorial     p. 231
  Jean-François Maurras and A. Ridha Mahjoub
  PDF file (40.12 KB)



• A branch-and-cut algorithm for a resource-constrained scheduling problem     p. 235
  Renaud Sirdey and Hervé L. M. Kerivin
  Abstract | PDF file (264.0 KB) | References



• On the minimum cost multiple-source unsplittable flow problem     p. 253
  Meriema Belaidouni and Walid Ben-Ameur
  Abstract | PDF file (228.9 KB) | References



• Clique partitioning of interval graphs with submodular costs on the cliques     p. 275
  Dion Gijswijt, Vincent Jost and Maurice Queyranne
  Abstract | PDF file (181.8 KB) | References



• A note on the Chvátal-rank of clique family inequalities     p. 289
  Arnaud Pêcher and Annegret K. Wagler
  Abstract | PDF file (121.0 KB) | References



• On co-bicliques     p. 295
  Denis Cornaz
  Abstract | PDF file (158.4 KB) | References



• Approximation algorithms for metric tree cover and generalized tour and tree covers     p. 305
  Viet Hung Nguyen
  Abstract | PDF file (155.4 KB) | References



• The Polytope of m-Subspaces of a Finite Affine Space     p. 317
  Julie Christophe and Jean-Paul Doignon
  Abstract | PDF file (299.0 KB) | References