Polyhedral results for the equitable coloring problem
From MaRDI portal
Abstract: In this work we study the polytope associated with a 0/1 integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. We also present computational evidence of the effectiveness of including these inequalities as cuts in a Branch & Cut algorithm.
Recommendations
- A polyhedral approach for the equitable coloring problem
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
- Equitable coloring of some convex polytope graphs
- A polyhedral approach for graph coloring
- A DSATUR-based algorithm for the equitable coloring problem
Cites work
Cited in
(5)- Equitable coloring of some convex polytope graphs
- Facets of the graph coloring polytope
- A polyhedral approach for the equitable coloring problem
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
- scientific article; zbMATH DE number 7058467 (Why is no real title available?)
This page was built for publication: Polyhedral results for the equitable coloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840701)