A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations

Michel Minoux · RAIRO - Operations Research · 1987

A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations Revue française d'automatique, d'informatique et de recherche opérationnelle.Recherche opérationnelle, tome 21, n o 2 (1987), p. 105-136.

Read the paper · More papers on PaperTik