Staging in Balas' algorithm

Jaroslav Hrouda · Applications of Mathematics · 1971

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.

Read the paper · More papers on PaperTik