A cutting-plane algorithm for the Steiner team orienteering problem.
Lucas AssunçãoGeraldo Robson MateusPublished in: Comput. Ind. Eng. (2019)
Keyphrases
- cutting plane algorithm
- cutting plane
- integer programming
- maximum margin
- metaheuristic
- max flow
- column generation
- vehicle routing problem with time windows
- valid inequalities
- linear svm
- hyperplane
- routing problem
- linear programming
- decomposition methods
- mathematical model
- maximum likelihood
- learning algorithm
- lagrangian relaxation
- lower bound
- optimal solution
- feature selection