Valid inequalities for a time-indexed formulation.
Lotte BerghmanFrits C. R. SpieksmaPublished in: Oper. Res. Lett. (2015)
Keyphrases
- valid inequalities
- integer programming
- mixed integer
- traveling salesman problem
- cutting plane algorithm
- mixed integer programming
- convex hull
- linear programming
- feasible solution
- integer program
- linear programming relaxation
- lower and upper bounds
- cutting plane
- mixed integer linear programs
- integer programming formulation
- column generation
- randomly generated problems
- primal dual
- network design problem
- mixed integer program
- set partitioning
- continuous variables
- linear program
- lp relaxation
- facet defining
- lot sizing
- ant colony optimization
- metaheuristic
- particle swarm optimization
- upper bound
- lower bound