A branch-and-cut algorithm for equitable coloring based on a formulation by representatives

DOI10.1016/J.ENDM.2009.11.057zbMATH Open1268.90110OpenAlexW2114903113MaRDI QIDQ2840561FDOQ2840561

Authors: Laura Bahiense, Y. Frota, Thiago F. Noronha, Nelson Maculan, Celso C. Ribeiro 

Publication date: 19 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.2009.11.057

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Cites Work

• A branch-and-cut algorithm for partition coloring
• Equitable Coloring
• Perfect Graphs and an Application to Optimizing Municipal Services
• Cliques, holes and the vertex coloring polytope
• Title not available (Why is that?)

Cited In (5)

• A polyhedral approach for the equitable coloring problem
• A combined parallel Lagrangian decomposition and cutting-plane generation for maximum stable set problems
• Integer programming formulations and efficient local search for relaxed correlation clustering
• A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
• Polyhedral results for the equitable coloring problem

This page was built for publication: A branch-and-cut algorithm for equitable coloring based on a formulation by representatives

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