Pages that link to "Item:Q607006"
From MaRDI portal
The following pages link to Size-constrained graph partitioning polytopes (Q607006):
Displaying 14 items.
- Iterated maxima search for the maximally diverse grouping problem (Q323418) (← links)
- An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
- Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment (Q1631652) (← links)
- The sport teams grouping problem (Q1730756) (← links)
- Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes (Q1751235) (← links)
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- An exact approach for the multi-constraint graph partitioning problem (Q2219514) (← links)
- Balanced Partition of a Graph for Football Team Realignment in Ecuador (Q2835691) (← links)
- The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
