A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem.
Simon GörtzAndreas KlosePublished in: INFORMS J. Comput. (2012)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- randomly generated
- lower bounding
- np hard
- search tree
- upper bounding
- test problems
- single machine scheduling problem
- variable ordering
- finding an optimal solution
- randomly generated problems
- precedence constraints
- maximum clique
- weighted max sat
- mixed integer linear programming
- max sat
- bayesian networks