Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound.

Eric V. Denardo Bennett L. Fox

Published in: Oper. Res. (1979)

Keyphrases

branch and bound
search algorithm
optimal solution
lower bound
branch and bound algorithm
multi agent
search space
beam search
optimization problems
knapsack problem
linear programming relaxation
network design problem