Geodesic
On the complexity of the solution of a class of integer linear programming problems
Diskretnyj analiz i issledovanie operacij, Tome 10 (2003) no. 1, pp. 3-10

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

@article{DA_2003_10_1_a0,
     author = {N. Yu. Zolotykh},
     title = {On the complexity of the solution of a class of integer linear programming problems},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--10},
     publisher = {mathdoc},
     volume = {10},
     number = {1},
     year = {2003},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2003_10_1_a0/}
}
TY  - JOUR
AU  - N. Yu. Zolotykh
TI  - On the complexity of the solution of a class of integer linear programming problems
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2003
SP  - 3
EP  - 10
VL  - 10
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2003_10_1_a0/
LA  - ru
ID  - DA_2003_10_1_a0
ER  - 
%0 Journal Article
%A N. Yu. Zolotykh
%T On the complexity of the solution of a class of integer linear programming problems
%J Diskretnyj analiz i issledovanie operacij
%D 2003
%P 3-10
%V 10
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2003_10_1_a0/
%G ru
%F DA_2003_10_1_a0
N. Yu. Zolotykh. On the complexity of the solution of a class of integer linear programming problems. Diskretnyj analiz i issledovanie operacij, Tome 10 (2003) no. 1, pp. 3-10. http://geodesic.mathdoc.fr/item/DA_2003_10_1_a0/