Geodesic
Methods of implicit enumeration for solving integer programming problems with bivalent variables
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 4 (1970), pp. 17-29

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

@article{IVM_1970_4_a1,
     author = {J. V. Romanovsky},
     title = {Methods of implicit enumeration for solving integer programming problems with bivalent variables},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {17--29},
     publisher = {mathdoc},
     number = {4},
     year = {1970},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1970_4_a1/}
}
TY  - JOUR
AU  - J. V. Romanovsky
TI  - Methods of implicit enumeration for solving integer programming problems with bivalent variables
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1970
SP  - 17
EP  - 29
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_1970_4_a1/
LA  - ru
ID  - IVM_1970_4_a1
ER  - 
%0 Journal Article
%A J. V. Romanovsky
%T Methods of implicit enumeration for solving integer programming problems with bivalent variables
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1970
%P 17-29
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_1970_4_a1/
%G ru
%F IVM_1970_4_a1
J. V. Romanovsky. Methods of implicit enumeration for solving integer programming problems with bivalent variables. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 4 (1970), pp. 17-29. http://geodesic.mathdoc.fr/item/IVM_1970_4_a1/