Geodesic
The branch and bound method for solving the problem of linear ordering on weighted tournaments
Diskretnyj analiz i issledovanie operacij, Tome 8 (2001) no. 2, pp. 73-91

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2001_8_2_a6,
     author = {I. Charon and O. Hudry},
     title = {The branch and bound method for solving the problem of linear ordering on weighted tournaments},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {73--91},
     publisher = {mathdoc},
     volume = {8},
     number = {2},
     year = {2001},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2001_8_2_a6/}
}
TY  - JOUR
AU  - I. Charon
AU  - O. Hudry
TI  - The branch and bound method for solving the problem of linear ordering on weighted tournaments
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2001
SP  - 73
EP  - 91
VL  - 8
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2001_8_2_a6/
LA  - ru
ID  - DA_2001_8_2_a6
ER  - 
%0 Journal Article
%A I. Charon
%A O. Hudry
%T The branch and bound method for solving the problem of linear ordering on weighted tournaments
%J Diskretnyj analiz i issledovanie operacij
%D 2001
%P 73-91
%V 8
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2001_8_2_a6/
%G ru
%F DA_2001_8_2_a6
I. Charon; O. Hudry. The branch and bound method for solving the problem of linear ordering on weighted tournaments. Diskretnyj analiz i issledovanie operacij, Tome 8 (2001) no. 2, pp. 73-91. http://geodesic.mathdoc.fr/item/DA_2001_8_2_a6/