Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation.
Andreas KloseAndreas DrexlPublished in: Manag. Sci. (2005)
Keyphrases
- column generation
- lower bound
- branch and bound
- upper bound
- branch and bound algorithm
- optimal solution
- linear programming relaxation
- lagrangian relaxation
- cutting plane
- vehicle routing
- integer program
- integer linear programming
- linear programming
- set partitioning
- lagrangean relaxation
- exact solution
- np hard
- mixed integer programming
- objective function
- linear program
- set covering
- lower and upper bounds
- vehicle routing problem with time windows
- search algorithm
- integer programming
- linear programming problems
- linear relaxation
- dantzig wolfe decomposition
- max sat
- search space
- constraint programming
- sample complexity
- traveling salesman problem
- combinatorial optimization
- worst case
- cutting plane algorithm
- evolutionary algorithm
- scheduling problem
- multi objective
- special case