Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH.
Maximilian ThiessenLuis QuesadaKenneth N. BrownPublished in: CPAIOR (2020)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- column generation
- combinatorial optimization
- optimal solution
- search space
- upper bound
- randomly generated problems
- branch and bound procedure
- network design problem
- branch and bound method
- beam search
- tree decomposition
- integer programming problems
- cost function
- tree search algorithm
- tree search
- max sat
- partial solutions
- tabu search
- depth first search
- reduce the search space
- linear programming relaxation
- spanning tree
- branch and bound search
- search strategies
- feasible solution
- linear program
- implicit enumeration
- np hard