Staging in Balas' algorithm
Applications of Mathematics, Tome 16 (1971) no. 5, pp. 354-369
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.
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.
@article{10_21136_AM_1971_103367,
author = {Hrouda, Jaroslav},
title = {Staging in {Balas'} algorithm},
journal = {Applications of Mathematics},
pages = {354--369},
year = {1971},
volume = {16},
number = {5},
doi = {10.21136/AM.1971.103367},
mrnumber = {0465174},
zbl = {0243.90025},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.1971.103367/}
}
Hrouda, Jaroslav. Staging in Balas' algorithm. Applications of Mathematics, Tome 16 (1971) no. 5, pp. 354-369. doi: 10.21136/AM.1971.103367
Cité par Sources :