Tome 41 (2007) no. 3

Sommaire

Editorial
p. 231-233
A branch-and-cut algorithm for a resource-constrained scheduling problem
p. 235-251
On the minimum cost multiple-source unsplittable flow problem
p. 253-273
Clique partitioning of interval graphs with submodular costs on the cliques
p. 275-287
A note on the Chvátal-rank of clique family inequalities
p. 289-294
On co-bicliques
p. 295-304
Approximation algorithms for metric tree cover and generalized tour and tree covers
p. 305-315
The polytope of m-subspaces of a finite affine space
p. 317-344