Pages that link to "Item:Q6092622"
From MaRDI portal
The following pages link to The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622):
Displaying 4 items.
- An efficient heuristic for the \(k\)-partitioning problem (Q6063777) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
- Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks (Q6565391) (← links)
