A Branch-And-Price Approach for Graph Multi-Coloring
From MaRDI portal
Recommendations
- A Column Generation Approach for Graph Coloring
- Exact solution of graph coloring problems via constraint programming and column generation
- A Wide Branching Strategy for the Graph Coloring Problem
- A branch-and-price approach for the partition coloring problem
- A branch-and-price algorithm for the robust graph coloring problem
Cited in
(13)- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope
- Computing near-optimal value-at-risk portfolios using integer programming techniques
- A branch and price algorithm for list coloring problem
- A branch-and-price approach for the partition coloring problem
- A branch-and-price algorithm for the robust graph coloring problem
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- Exact solution of graph coloring problems via constraint programming and column generation
- A Wide Branching Strategy for the Graph Coloring Problem
- A Column Generation Approach for Graph Coloring
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
- An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem
- A simple branching scheme for vertex coloring problems
- Solving a multicoloring problem with overlaps using integer programming
This page was built for publication: A Branch-And-Price Approach for Graph Multi-Coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439965)