Geodesic
Lower bounds to the graph partitioning problem through generalized linear programming and network flows
RAIRO - Operations Research - Recherche Opérationnelle, Tome 21 (1987) no. 4, pp. 349-364

Voir la notice de l'article provenant de la source Numdam

@article{RO_1987__21_4_349_0,
     author = {Minoux, M. and Pinson, E.},
     title = {Lower bounds to the graph partitioning problem through generalized linear programming and network flows},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {349--364},
     publisher = {EDP-Sciences},
     volume = {21},
     number = {4},
     year = {1987},
     mrnumber = {932184},
     zbl = {0657.90095},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RO_1987__21_4_349_0/}
}
TY  - JOUR
AU  - Minoux, M.
AU  - Pinson, E.
TI  - Lower bounds to the graph partitioning problem through generalized linear programming and network flows
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1987
SP  - 349
EP  - 364
VL  - 21
IS  - 4
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/RO_1987__21_4_349_0/
LA  - en
ID  - RO_1987__21_4_349_0
ER  - 
%0 Journal Article
%A Minoux, M.
%A Pinson, E.
%T Lower bounds to the graph partitioning problem through generalized linear programming and network flows
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1987
%P 349-364
%V 21
%N 4
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/RO_1987__21_4_349_0/
%G en
%F RO_1987__21_4_349_0
Minoux, M.; Pinson, E. Lower bounds to the graph partitioning problem through generalized linear programming and network flows. RAIRO - Operations Research - Recherche Opérationnelle, Tome 21 (1987) no. 4, pp. 349-364. http://geodesic.mathdoc.fr/item/RO_1987__21_4_349_0/