Method of shifting units for solving the zero-one linear programming problem
Applications of Mathematics, Tome 17 (1972) no. 3, pp. 169-182.

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

The method is of enumerative type. The enumeration process on classes of zero-one vectors so that the recursive transition from one class to another is accomplished by shifting one unit into the next right component.
DOI : 10.21136/AM.1972.103407
Classification : 90C05, 90C10
@article{10_21136_AM_1972_103407,
     author = {Hrouda, Jaroslav},
     title = {Method of shifting units for solving the zero-one linear programming problem},
     journal = {Applications of Mathematics},
     pages = {169--182},
     publisher = {mathdoc},
     volume = {17},
     number = {3},
     year = {1972},
     doi = {10.21136/AM.1972.103407},
     mrnumber = {0297359},
     zbl = {0251.90031},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.1972.103407/}
}
TY  - JOUR
AU  - Hrouda, Jaroslav
TI  - Method of shifting units for solving the zero-one linear programming problem
JO  - Applications of Mathematics
PY  - 1972
SP  - 169
EP  - 182
VL  - 17
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.21136/AM.1972.103407/
DO  - 10.21136/AM.1972.103407
LA  - en
ID  - 10_21136_AM_1972_103407
ER  - 
%0 Journal Article
%A Hrouda, Jaroslav
%T Method of shifting units for solving the zero-one linear programming problem
%J Applications of Mathematics
%D 1972
%P 169-182
%V 17
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.21136/AM.1972.103407/
%R 10.21136/AM.1972.103407
%G en
%F 10_21136_AM_1972_103407
Hrouda, Jaroslav. Method of shifting units for solving the zero-one linear programming problem. Applications of Mathematics, Tome 17 (1972) no. 3, pp. 169-182. doi : 10.21136/AM.1972.103407. http://geodesic.mathdoc.fr/articles/10.21136/AM.1972.103407/

Cité par Sources :