Pages that link to "Item:Q2639779"
From MaRDI portal
The following pages link to The equipartition polytope. I: Formulations, dimension and basic facets (Q2639779):
Displayed 26 items.
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- On the polyhedral structure of uniform cut polytopes (Q401136) (← links)
- From equipartition to uniform cut polytopes: extended polyhedral results (Q533779) (← links)
- Size-constrained graph partitioning polytopes (Q607006) (← links)
- Facets for the cut cone. I (Q1199749) (← links)
- Facets for the cut cone. II: Clique-web inequalities (Q1199750) (← links)
- Min-cut clustering (Q1321669) (← links)
- A computational study of graph partitioning (Q1340061) (← links)
- Cardinality constrained Boolean quadratic polytope (Q1372737) (← links)
- A branch-and-cut algorithm for the equicut problem (Q1373750) (← links)
- Solution of large weighted equicut problems (Q1609912) (← links)
- Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes (Q1751235) (← links)
- Hamiltonian path and symmetric travelling salesman polytopes (Q1803617) (← links)
- Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- Some new classes of facets for the equicut polytope (Q1900144) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- The partition problem (Q2366610) (← links)
- A polyhedral approach for a constrained quadratic 0-1 problem (Q2387431) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
- The equipartition polytope. II: Valid inequalities and facets (Q2639780) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (Q3503843) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)