About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Hrouda, Jaroslav
Method of shifting units for solving the zero-one linear programming problem. (English). Aplikace matematiky, vol. 17 (1972), issue 3, pp. 169-182
MSC: 90C05, 90C10 | MR 0297359 | Zbl 0251.90031 | DOI: 10.21136/AM.1972.103407
Summary:
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.
References:
[1] Balas E.: An additive algorithm for solving linear programs with zero-one variables. Operations Research 13 (1965), No 4, 517-546. DOI 10.1287/opre.13.4.517 | MR 0183535 | Zbl 0194.19903
[2] Výzkumná zpráva VZ-60/67. (řešitel J. Hrouda). VÚTECHP, Praha 1967, 12-16.
Partner of
EuDML logo