Solving the 2-rooted mini-max spanning forest problem by branch-and-bound.
M. MekkingA. VolgenantPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- branch and bound
- combinatorial optimization
- integer programming problems
- branch and bound search
- lower bound
- branch and bound algorithm
- search algorithm
- column generation
- upper bound
- search space
- optimal solution
- branch and bound procedure
- implicit enumeration
- branch and bound method
- beam search
- randomly generated problems
- bnb adopt
- tree search
- tree search algorithm
- partial solutions
- network design problem
- integer program
- linear programming
- linear programming relaxation
- neural network
- traveling salesman problem
- lagrangian heuristic
- previously solved
- search heuristics
- cutting plane
- max sat
- optimization problems