Pages that link to "Item:Q448972"
From MaRDI portal
The following pages link to Exact weighted vertex coloring via branch-and-price (Q448972):
Displaying 15 items.
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← 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)
- A branch-and-price algorithm for the robust graph coloring problem (Q2448920) (← links)
- Iterated local search with tabu search for the weighted vertex coloring problem (Q2664440) (← links)
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams (Q2806865) (← links)
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs (Q2819518) (← links)
- Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring (Q6579767) (← links)
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022 (Q6579770) (← links)
- Solving the list coloring problem through a branch-and-price algorithm (Q6586219) (← links)
