The following pages link to Facets for the cut cone. I (Q1199749):
Displaying 43 items.
- On the directed cut cone and polytope (Q281821) (← links)
- Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
- Small bipartite subgraph polytopes (Q613319) (← links)
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← 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)
- On Hilbert bases of cuts (Q898132) (← links)
- Lifting facets of the cut polytope (Q923115) (← links)
- Compositions in the bipartite subgraph polytope (Q1199475) (← links)
- Extension operations for cuts (Q1199597) (← links)
- Facets for the cut cone. II: Clique-web inequalities (Q1199750) (← links)
- Max-cut in circulant graphs (Q1201272) (← links)
- An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
- The hypermetric cone is polyhedral (Q1316645) (← links)
- \(\ell_ 1\)-rigid graphs (Q1321589) (← links)
- Collapsing and lifting for the cut cone (Q1322220) (← links)
- The volume of relaxed Boolean-quadric and cut polytopes (Q1356562) (← links)
- Checking robust nonsingularity is NP-hard (Q1802197) (← links)
- All facets of the cut cone \(C_ n\) for \(n=7\) are known (Q1813725) (← links)
- Hypercube embedding of generalized bipartite metrics (Q1842652) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
- On a positive semidefinite relaxation of the cut polytope (Q1894508) (← links)
- Facets of the \(k\)-partition polytope (Q1897366) (← links)
- Some new classes of facets for the equicut polytope (Q1900144) (← links)
- Gap inequalities for the cut polytope (Q1911843) (← links)
- New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities (Q2381532) (← 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)
- Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- On the Linear Description of the k-cycle Polytope (Q3146124) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
- Clique-Web Facets for Multicut Polytopes (Q4027782) (← links)
- Lattice Points of Cut Cones (Q4305316) (← 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)
- On skeletons, diameters and volumes of metric polyhedra (Q6567675) (← links)
- On the dominant of the multicut polytope (Q6624194) (← links)
