On the Hardness of Almost All Subset Sum Problems by Ordinary Branch-and-Bound.
Mustafa Kemal TuralPublished in: CoRR (2020)
Keyphrases
- branch and bound
- randomly generated problems
- branch and bound procedure
- combinatorial optimization
- lower bound
- search algorithm
- search space
- branch and bound method
- column generation
- np complete
- partial solutions
- optimal solution
- upper bound
- network design problem
- branch and bound algorithm
- max sat
- optimization problems
- np hard
- integer programming problems
- lagrangian heuristic
- depth first search
- constraint programming