New Valid Inequalities for the Two-Echelon Capacitated Vehicle Routing Problem.
Guido PerboliRoberto TadeiEdoardo FaddaPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- valid inequalities
- multi item
- vehicle routing problem with time windows
- traveling salesman problem
- integer programming
- vehicle routing problem
- mixed integer
- linear programming
- mixed integer programming
- ant colony optimization
- lower and upper bounds
- cutting plane
- feasible solution
- mixed integer linear programs
- convex hull
- supply chain
- memetic algorithm
- lot sizing
- cutting plane algorithm
- routing problem
- integer program
- column generation
- network design problem
- primal dual
- linear programming relaxation
- lagrangian relaxation
- integer programming formulation
- facet defining inequalities
- lead time
- upper bound
- metaheuristic
- lower bound
- continuous variables
- constraint programming
- combinatorial optimization
- lp relaxation
- np hard
- genetic algorithm
- convergence rate
- multi objective
- objective function