Pages that link to "Item:Q4565766"
From MaRDI portal
The following pages link to A branch‐and‐price algorithm for the (<i>k,c</i>)‐coloring problem (Q4565766):
Displaying 5 items.
- An exact algorithm for the edge coloring by total labeling problem (Q2178329) (← links)
- The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← 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)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)