Pages that link to "Item:Q1038841"
From MaRDI portal
The following pages link to Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841):
Displaying 11 items.
- Exact weighted vertex coloring via branch-and-price (Q448972) (← links)
- Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
- The vertex coloring problem and its generalizations (Q1022440) (← links)
- A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports (Q1751727) (← 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 one-to-one correspondence between colorings and stable sets (Q2517790) (← links)
- Iterated local search with tabu search for the weighted vertex coloring problem (Q2664440) (← links)
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs (Q2819518) (← links)
- A metaheuristic framework for nonlinear capacitated covering problems (Q5963698) (← links)
