Geodesic
A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
RAIRO - Operations Research - Recherche Opérationnelle, Tome 21 (1987) no. 2, pp. 105-136 Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

@article{RO_1987__21_2_105_0,
     author = {Minoux, M.},
     title = {A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {105--136},
     year = {1987},
     publisher = {EDP-Sciences},
     volume = {21},
     number = {2},
     mrnumber = {897292},
     zbl = {0644.90061},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RO_1987__21_2_105_0/}
}
TY  - JOUR
AU  - Minoux, M.
TI  - A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1987
SP  - 105
EP  - 136
VL  - 21
IS  - 2
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/RO_1987__21_2_105_0/
LA  - en
ID  - RO_1987__21_2_105_0
ER  - 
%0 Journal Article
%A Minoux, M.
%T A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1987
%P 105-136
%V 21
%N 2
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/RO_1987__21_2_105_0/
%G en
%F RO_1987__21_2_105_0
Minoux, M. A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations. RAIRO - Operations Research - Recherche Opérationnelle, Tome 21 (1987) no. 2, pp. 105-136. http://geodesic.mathdoc.fr/item/RO_1987__21_2_105_0/