Pages that link to "Item:Q448972"
From MaRDI portal
The following pages link to Exact weighted vertex coloring via branch-and-price (Q448972):
Displaying 7 items.
- Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
- Interval scheduling with economies of scale (Q2108158) (← links)
- On Monte Carlo tree search for weighted vertex coloring (Q2163775) (← links)
- Graph coloring-based approach for railway station design analysis and capacity determination (Q2189952) (← links)
- Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
- Iterated local search with tabu search for the weighted vertex coloring problem (Q2664440) (← links)
