Pages that link to "Item:Q3439965"
From MaRDI portal
The following pages link to A Branch-And-Price Approach for Graph Multi-Coloring (Q3439965):
Displaying 9 items.
- A simple branching scheme for vertex coloring problems (Q765355) (← links)
- Solving a multicoloring problem with overlaps using integer programming (Q968150) (← links)
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
- Computing near-optimal value-at-risk portfolios using integer programming techniques (Q1754091) (← links)
- A branch-and-price algorithm for the robust graph coloring problem (Q2448920) (← links)
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams (Q2806865) (← links)
- Exact solution of graph coloring problems via constraint programming and column generation (Q2815431) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
