A Branch-And-Price Approach for Graph Multi-Coloring

DOI10.1007/978-0-387-48793-9_2zbMath1241.90185OpenAlexW145102989MaRDI QIDQ3439965

Michael A. Trick, Anuj Mehrotra

Publication date: 21 May 2007

Published in: Operations Research/Computer Science Interfaces Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-48793-9_2

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope ⋮ Computing near-optimal value-at-risk portfolios using integer programming techniques ⋮ Solving a multicoloring problem with overlaps using integer programming ⋮ Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation ⋮ A simple branching scheme for vertex coloring problems

This page was built for publication: A Branch-And-Price Approach for Graph Multi-Coloring