Branch-and-bound algorithm for a competitive facility location problem.
Vladimir L. BeresnevPublished in: Comput. Oper. Res. (2013)
Keyphrases
- branch and bound algorithm
- facility location problem
- facility location
- lagrangian relaxation
- approximation algorithms
- lower bound
- np hard
- branch and bound
- dominating set
- optimal solution
- upper bound
- lower bounding
- randomly generated problems
- combinatorial optimization
- mixed integer linear programming
- precedence constraints
- neural network
- integer programming
- single machine scheduling problem
- upper bounding
- max sat
- worst case
- network design
- network design problem
- special case
- mixed integer programming
- column generation
- metaheuristic
- np complete
- dynamic programming
- maximum clique
- objective function
- genetic algorithm