A Branch-And-Price Approach for Graph Multi-Coloring
From MaRDI portal
Publication:3439965
DOI10.1007/978-0-387-48793-9_2zbMath1241.90185MaRDI 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
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
05C15: Coloring of graphs and hypergraphs
Related Items
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs, A simple branching scheme for vertex coloring problems, Solving a multicoloring problem with overlaps using integer programming, Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope, Computing near-optimal value-at-risk portfolios using integer programming techniques, Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation