Facets based on cycles and cliques for the acyclic coloring polytope.
Mónica BragaJavier MarencoPublished in: RAIRO Oper. Res. (2020)
Keyphrases
- facet defining inequalities
- facet defining
- lattice points
- database schemes
- np hard
- stable set
- convex hull
- maximal cliques
- functional modules
- knapsack problem
- maximum clique
- hamiltonian cycle
- np complete
- evolutionary algorithm
- graph theory
- graph structure
- geometric properties
- hypertree decomposition
- probability distribution