Pages that link to "Item:Q2840561"
From MaRDI portal
The following pages link to A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives (Q2840561):
Displaying 5 items.
- Integer programming formulations and efficient local search for relaxed correlation clustering (Q2052402) (← links)
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
- A polyhedral approach for the equitable coloring problem (Q2448876) (← links)
- Polyhedral results for the Equitable Coloring Problem (Q2840701) (← links)
- A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems (Q2883604) (← links)
