Pages that link to "Item:Q496694"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694):
Displayed 10 items.
- A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
- Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
- \((N, p)\)-equitable \(b\)-coloring of graphs (Q1682874) (← links)
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
- Improving lower bounds for equitable chromatic number (Q2147053) (← links)
- A polyhedral approach for the equitable coloring problem (Q2448876) (← links)
- Iterated local search with tabu search for the weighted vertex coloring problem (Q2664440) (← links)
- A Tabu Search Heuristic for the Equitable Coloring Problem (Q3195344) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)