Pages that link to "Item:Q2940061"
From MaRDI portal
The following pages link to A Wide Branching Strategy for the Graph Coloring Problem (Q2940061):
Displaying 5 items.
- Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
- A simple branching scheme for vertex coloring problems (Q765355) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← 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)
