Journals
Seminars
Books
Lecture notes
Theses
Authors
OFF
Journals
Seminars
Books
Lecture notes
Theses
Authors
All
All
Author
Title
References
Keywords
Full text
Search
NOT
Between
and
Author
All
Author
Title
Date
References
Keywords
Full text
RAIRO - Operations Research - Recherche Opérationnelle
Volume 41 (2007)
no. 3
Table of contents
Editorial
Maurras, Jean-François
;
Mahjoub, A. Ridha
p. 231-233
A branch-and-cut algorithm for a resource-constrained scheduling problem
Sirdey, Renaud
;
Kerivin, Hervé L. M.
p. 235-251
On the minimum cost multiple-source unsplittable flow problem
Belaidouni, Meriema
;
Ben-Ameur, Walid
p. 253-273
Clique partitioning of interval graphs with submodular costs on the cliques
Gijswijt, Dion
;
Jost, Vincent
;
Queyranne, Maurice
p. 275-287
A note on the Chvátal-rank of clique family inequalities
Pêcher, Arnaud
;
Wagler, Annegret K.
p. 289-294
On co-bicliques
Cornaz, Denis
p. 295-304
Approximation algorithms for metric tree cover and generalized tour and tree covers
Nguyen, Viet Hung
p. 305-315
The polytope of
m
-subspaces of a finite affine space
Christophe, Julie
;
Doignon, Jean-Paul
p. 317-344
