The following pages link to (Q5687263):
Displaying 17 items.
- Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
- A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- An enumerative algorithm for the frequency assignment problem (Q1399116) (← links)
- A network-flow-based lower bound for the minimum weighted integer coloring problem (Q1589479) (← links)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- A cutting plane algorithm for graph coloring (Q2467348) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- An exact method for graph coloring (Q2489282) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- Solving the minimum-weighted coloring problem (Q2748384) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022 (Q6579770) (← links)
