Pages that link to "Item:Q2639780"
From MaRDI portal
The following pages link to The equipartition polytope. II: Valid inequalities and facets (Q2639780):
Displayed 21 items.
- 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)
- The inequicut cone (Q688255) (← links)
- A branch-and-cut algorithm for the partitioning-hub location-routing problem (Q709201) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- Min-cut clustering (Q1321669) (← 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)
- Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- Facets of the \(k\)-partition polytope (Q1897366) (← links)
- Some new classes of facets for the equicut polytope (Q1900144) (← links)
- Political districting to minimize cut edges (Q2099493) (← 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)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)