Pages that link to "Item:Q429677"
From MaRDI portal
The following pages link to An exact approach for the vertex coloring problem (Q429677):
Displaying 11 items.
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
- A polyhedral study of the maximum stable set problem with weights on vertex-subsets (Q299097) (← links)
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (Q322774) (← links)
- Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- Exact weighted vertex coloring via branch-and-price (Q448972) (← links)
- Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles (Q1752844) (← links)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
