Pages that link to "Item:Q1199750"
From MaRDI portal
The following pages link to Facets for the cut cone. II: Clique-web inequalities (Q1199750):
Displayed 21 items.
- Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
- The real positive semidefinite completion problem for series-parallel graphs (Q676039) (← links)
- The inequicut cone (Q688255) (← links)
- The even and odd cut polytopes (Q688256) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
- Compositions in the bipartite subgraph polytope (Q1199475) (← links)
- Facets for the cut cone. I (Q1199749) (← links)
- An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
- The hypermetric cone is polyhedral (Q1316645) (← links)
- Collapsing and lifting for the cut cone (Q1322220) (← 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)
- Generating facets for the cut polytope of a graph by triangular elimination (Q2465651) (← links)
- Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- The cut cone. III: On the role of triangle facets (Q5905548) (← links)
- The cut cone. III: On the role of triangle facets (Q5919846) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
- On the bond polytope (Q6060889) (← links)