Formulations and valid inequalities for the capacitated dispersion problem.
Mercedes LandeteJuanjo PeiróHande YamanPublished in: Networks (2023)
Keyphrases
- valid inequalities
- fixed charge
- network design problem
- integer programming
- mixed integer programming
- traveling salesman problem
- mixed integer
- linear programming
- lower and upper bounds
- lot sizing
- feasible solution
- convex hull
- multi item
- column generation
- cutting plane
- cutting plane algorithm
- mixed integer linear programs
- network flow problem
- linear programming relaxation
- integer programming formulation
- vehicle routing problem
- integer program
- lagrangian relaxation
- primal dual
- routing problem
- np hard
- lower bound
- continuous variables
- linear program
- facet defining inequalities
- optimal solution
- network flow
- genetic algorithm
- branch and bound
- constraint programming
- combinatorial optimization
- tabu search
- upper bound
- dynamic programming