A cutting-plane algorithm for the Steiner team orienteering problem.
Lucas AssunçãoGeraldo Robson MateusPublished in: CoRR (2020)
Keyphrases
- cutting plane algorithm
- cutting plane
- integer programming
- maximum margin
- max flow
- metaheuristic
- column generation
- vehicle routing problem with time windows
- routing problem
- valid inequalities
- lagrangian relaxation
- linear programming
- decomposition methods
- linear svm
- text classification
- integer program
- mixed integer
- vehicle routing problem
- high order
- multistage
- dynamic programming