Pages that link to "Item:Q3009768"
From MaRDI portal
The following pages link to Safe Lower Bounds for Graph Coloring (Q3009768):
Displaying 7 items.
- Exact weighted vertex coloring via branch-and-price (Q448972) (← links)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
- A branch and price algorithm for list coloring problem (Q2132397) (← links)
- An integer programming approach to b-coloring (Q2419584) (← links)
- Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
- The maximum-impact coloring polytope (Q2968505) (← links)
- Solving the list coloring problem through a branch-and-price algorithm (Q6586219) (← links)
