New valid inequalities and facets for the Simple Plant Location Problem.
Laura GalliAdam N. LetchfordSebastian J. MillerPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- valid inequalities
- facet defining inequalities
- facet defining
- integer programming
- traveling salesman problem
- mixed integer programming
- cutting plane algorithm
- cutting plane
- mixed integer
- linear programming
- lower and upper bounds
- convex hull
- mixed integer linear programs
- linear programming relaxation
- feasible solution
- column generation
- primal dual
- integer programming formulation
- randomly generated problems
- integer programming problems
- network design problem
- capacitated fixed charge
- integer program
- tabu search
- ant colony optimization
- lp relaxation
- combinatorial optimization
- np hard
- lagrangian relaxation