Facet-inducing web and antiweb inequalities for the graph coloring polytope.
Gintaras PalubeckisPublished in: Discret. Appl. Math. (2010)
Keyphrases
- graph coloring
- hamiltonian cycle
- combinatorial problems
- facet defining inequalities
- constraint satisfaction problems
- np complete problems
- job shop scheduling
- scheduling problem
- max sat
- phase transition
- facet defining
- sufficient conditions
- constraint programming
- convex hull
- hyper heuristics
- constraint satisfaction
- subtour elimination
- valid inequalities
- metaheuristic
- dynamic programming
- neural network