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 3 items.
- Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams (Q2806865) (← links)
