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

Article

First Page Preview
Hrouda, Jaroslav
Staging in Balas' algorithm. (English). Aplikace matematiky, vol. 16 (1971), issue 5, pp. 354-369
MSC: 65K05, 90C10 | MR 0465174 | Zbl 0243.90025 | DOI: 10.21136/AM.1971.103367
Summary:
The staging arises when some right-hand sides of the zero-one linear programming problem (the objective function being constrained by its current lowes value) gradually expand by discrete values. A generalization of Glover's way of recording the backtrack-type enumeration process is developed to solve such problems.
References:
[1] Hrouda J.: A contribution to Balas' algorithm. This issue, 336-353. MR 0465173 | Zbl 0246.90032
[2] Hrouda J.: Tři příspěvky k bivalentnímu lineárnímu programování. Příloha k výzkumné zprávě VZ-321/70. VÚTECHP, Praha 1970.
[3] Výzkumná zpráva VZ-124/68. (řešitel J. Hrouda). VÚTECHP, Praha 1968.
Partner of
EuDML logo