New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP.
Vicky H. MakAndreas T. ErnstPublished in: Math. Methods Oper. Res. (2007)
Keyphrases
- cutting plane
- vehicle routing problem
- traveling salesman problem
- lower bound
- column generation
- knapsack problem
- branch and bound
- integer programming
- branch and bound algorithm
- vehicle routing problem with time windows
- combinatorial optimization problems
- cutting plane algorithm
- integer programming problems
- vehicle routing
- valid inequalities
- routing problem
- mixed integer
- dantzig wolfe decomposition
- combinatorial optimization
- np hard
- upper bound
- mixed integer programming
- integer program
- tabu search
- metaheuristic
- search tree
- constraint programming
- linear programming
- optimization problems
- search space