A new extended formulation with valid inequalities for the Capacitated Concentrator Location Problem.
Massimo Di FrancescoManlio GaudiosoEnrico GorgoneIshwar MurthyPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- valid inequalities
- network design problem
- linear programming relaxation
- fixed charge
- integer programming
- mixed integer programming
- mixed integer
- traveling salesman problem
- linear programming
- lower and upper bounds
- feasible solution
- cutting plane
- cutting plane algorithm
- integer programming formulation
- randomly generated problems
- convex hull
- integer program
- lot sizing
- network flow problem
- mixed integer linear programs
- lagrangian relaxation
- primal dual
- column generation
- multi item
- mixed integer program
- lower bound
- routing problem
- np hard
- set partitioning
- knapsack problem
- cost function
- network design
- production planning
- lp relaxation
- continuous variables
- constraint programming
- objective function
- randomly generated
- upper bound
- facet defining inequalities
- facet defining