Exponential lower bounds on the size of approximate formulations in the natural encoding for Capacitated Facility Location.
Stavros G. KolliopoulosYannis MoysoglouPublished in: CoRR (2013)
Keyphrases
- facility location
- lower bound
- multi commodity
- lagrangian relaxation
- facility location problem
- integer programming
- mixed integer
- network design
- heuristic solution
- upper bound
- optimal location
- multi criteria
- np hard
- branch and bound algorithm
- objective function
- lot sizing
- valid inequalities
- optimal solution
- lower and upper bounds
- branch and bound
- dynamic programming
- genetic algorithm
- network design problem
- worst case