Pages that link to "Item:Q325423"
From MaRDI portal
The following pages link to Lower bounding techniques for DSATUR-based branch and bound (Q325423):
Displaying 6 items.
- Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
- Bounding vertex coloring by truncatedmultistage branch and bound (Q3157032) (← links)
- An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem (Q4565777) (← links)
- Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999) (← links)