Pages that link to "Item:Q1900144"
From MaRDI portal
The following pages link to Some new classes of facets for the equicut polytope (Q1900144):
Displaying 15 items.
- On the polyhedral structure of uniform cut polytopes (Q401136) (← links)
- From equipartition to uniform cut polytopes: extended polyhedral results (Q533779) (← links)
- The inequicut cone (Q688255) (← links)
- The even and odd cut polytopes (Q688256) (← links)
- A branch-and-cut algorithm for the equicut problem (Q1373750) (← links)
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939) (← 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)
- An overview of graph covering and partitioning (Q2142633) (← 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)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (Q3503843) (← links)
- New facets for the planar subgraph polytope (Q5449667) (← links)