A cutting plane algorithm for the capacitated arc routing problem.
José-Manuel BelenguerEnrique BenaventPublished in: Comput. Oper. Res. (2003)
Keyphrases
- cutting plane algorithm
- valid inequalities
- routing problem
- cutting plane
- integer programming
- lower bound
- lower and upper bounds
- traveling salesman problem
- linear programming
- mixed integer programming
- memetic algorithm
- mixed integer
- max flow
- maximum margin
- feasible solution
- column generation
- integer program
- vehicle routing problem with time windows
- lagrangian relaxation
- convex hull
- primal dual
- upper bound
- linear svm
- np hard
- continuous variables
- constraint programming
- hyperplane
- objective function