The distance polytope for the vertex coloring problem

DOI10.1007/978-3-319-96151-4_13MaRDI QIDQ1661874zbMATH OpenOpenAlexFDO

Authors Rosiane de Freitas, Javier Marenco, Bruno H. Dias, Nelson Maculan

Publication date 17 August 2018

Full work available at URL https://doi.org/10.1007/978-3-319-96151-4_13

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• A polyhedral approach for graph coloring
• Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model
• Polyhedral studies of vertex coloring problems: the standard formulation
• Fractional programming formulation for the vertex coloring problem
• Distance Coloring

Cited in

(1)

• Notes on models for distance coloring problems

This page was built for publication: The distance polytope for the vertex coloring problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661874)