Pages that link to "Item:Q4027782"
From MaRDI portal
The following pages link to Clique-Web Facets for Multicut Polytopes (Q4027782):
Displayed 14 items.
- Size-constrained graph partitioning polytopes (Q607006) (← links)
- The even and odd cut polytopes (Q688256) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Compositions in the bipartite subgraph polytope (Q1199475) (← links)
- Facets for the cut cone. II: Clique-web inequalities (Q1199750) (← links)
- Collapsing and lifting for the cut cone (Q1322220) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- Facets of the \(k\)-partition polytope (Q1897366) (← links)
- On the partial order polytope of a digraph (Q1915807) (← links)
- The partition problem (Q2366610) (← links)
- Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
- The clique partitioning problem: Facets and patching facets (Q4537609) (← links)