Pages that link to "Item:Q2467133"
From MaRDI portal
The following pages link to Facet-defining inequalities for the simple graph partitioning polytope (Q2467133):
Displaying 9 items.
- An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
- Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
- Size-constrained graph partitioning polytopes (Q607006) (← 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)
- 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)
