Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems.

Walter H. Kohler Kenneth Steiglitz

Published in: J. ACM (1974)

Keyphrases

branch and bound algorithm
test problems
combinatorial optimization
set covering problem
branch and bound
combinatorial problems
randomly generated problems
upper bound
optimization problems
scheduling problem
np complete
decision problems
search tree
finding an optimal solution