Pages that link to "Item:Q516805"
From MaRDI portal
The following pages link to Solving vertex coloring problems as maximum weight stable set problems (Q516805):
Displaying 9 items.
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
- A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
- On the benchmark instances for the bin packing problem with conflicts (Q2056901) (← links)
- On Monte Carlo tree search for weighted vertex coloring (Q2163775) (← links)
- An exact algorithm for the edge coloring by total labeling problem (Q2178329) (← links)
- Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
- A note on selective line-graphs and partition colorings (Q2294381) (← links)
- Reducing hypergraph coloring to clique search (Q2422750) (← links)
- Iterated local search with tabu search for the weighted vertex coloring problem (Q2664440) (← links)
