Geodesic
A Method for Construction of Strongest Cuts and Generation of Minimal Covers for 0-1 Linear Programming Problems
Mathematica balkanica, Tome 2 (1988) no. 1, p. 32 Cet article a éte moissonné depuis la source Mathematicac Balkanica website

Voir la notice de l'article

@article{MABA_1988_2_1_a4,
     author = {R. A. Andonov},
     title = {A {Method} for {Construction} of {Strongest} {Cuts} and {Generation} of {Minimal} {Covers} for 0-1 {Linear} {Programming} {Problems}},
     journal = {Mathematica balkanica},
     pages = {32},
     year = {1988},
     volume = {2},
     number = {1},
     url = {http://geodesic.mathdoc.fr/item/MABA_1988_2_1_a4/}
}
TY  - JOUR
AU  - R. A. Andonov
TI  - A Method for Construction of Strongest Cuts and Generation of Minimal Covers for 0-1 Linear Programming Problems
JO  - Mathematica balkanica
PY  - 1988
SP  - 32
VL  - 2
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/MABA_1988_2_1_a4/
ID  - MABA_1988_2_1_a4
ER  - 
%0 Journal Article
%A R. A. Andonov
%T A Method for Construction of Strongest Cuts and Generation of Minimal Covers for 0-1 Linear Programming Problems
%J Mathematica balkanica
%D 1988
%P 32
%V 2
%N 1
%U http://geodesic.mathdoc.fr/item/MABA_1988_2_1_a4/
%F MABA_1988_2_1_a4
R. A. Andonov. A Method for Construction of Strongest Cuts and Generation of Minimal Covers for 0-1 Linear Programming Problems. Mathematica balkanica, Tome 2 (1988) no. 1, p. 32. http://geodesic.mathdoc.fr/item/MABA_1988_2_1_a4/