A cutting plane algorithm for graph coloring.
Isabel Méndez-DíazPaula ZabalaPublished in: Discret. Appl. Math. (2008)
Keyphrases
- graph coloring
- cutting plane algorithm
- cutting plane
- combinatorial problems
- integer programming
- job shop scheduling
- maximum margin
- phase transition
- max sat
- constraint satisfaction problems
- max flow
- constraint programming
- column generation
- linear programming
- valid inequalities
- scheduling problem
- combinatorial optimization
- routing problem
- linear svm
- constraint satisfaction
- hyper heuristics
- metaheuristic
- global constraints
- hyperplane
- cellular automata
- machine learning