An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs.
Oylum SekerTínaz EkimZ. Caner TaskinPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- cutting plane algorithm
- cutting plane
- lagrangian dual
- maximum margin
- integer programming
- integer program
- linear programming
- exact solution
- shortest path
- learning algorithm
- column generation
- lower bound
- traveling salesman problem
- routing problem
- upper bound
- special case
- valid inequalities
- feature space
- search algorithm