Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope

DOI10.1016/j.endm.2011.05.037zbMath1268.05065OpenAlexW1988922349MaRDI QIDQ2840711

Javier Marenco, Mónica Braga

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.037

zbMATH Keywords

polyhedral combinatoricsacyclic coloringdisjunctive rank

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope

Uses Software

• ColPack

Cites Work

• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
• The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
• A polyhedral study of the acyclic coloring problem

This page was built for publication: Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope