A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints.
Bernard GendronPaul-Virak KhuongFrédéric SemetPublished in: Transp. Sci. (2016)
Keyphrases
- branch and bound algorithm
- optimal solution
- lagrangian relaxation
- lower bound
- precedence constraints
- branch and bound
- randomly generated
- test problems
- upper bound
- np hard
- combinatorial optimization
- randomly generated problems
- mixed integer linear programming
- set covering problem
- finding an optimal solution
- upper bounding
- integer variables
- lower bounding
- search tree
- variable ordering
- search space
- mixed integer programming
- branch and bound method
- lower and upper bounds
- neural network
- integer programming
- knapsack problem
- constraint satisfaction
- constraint programming