Pages that link to "Item:Q403653"

The following pages link to Lifting and separation procedures for the cut polytope (Q403653):

Displaying 22 items.

• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
• Separating lifted odd-hole inequalities to solve the index selection problem (Q1304469) (← links)
• Collapsing and lifting for the cut cone (Q1322220) (← links)
• Retracts and algebraic properties of cut algebras (Q1686265) (← links)
• The hypermetric cone and polytope on eight vertices and some generalizations (Q1745770) (← links)
• Local search inequalities (Q1751111) (← links)
• General cut-generating procedures for the stable set polytope (Q1752480) (← links)
• Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
• Seminormality, canonical modules, and regularity of cut polytopes (Q1979324) (← links)
• Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
• Generalized cut and metric polytopes of graphs and simplicial complexes (Q2174869) (← links)
• Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
• A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
• A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
• Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
• Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
• A polyhedral study of lifted multicuts (Q2688466) (← links)
• Necessary conditions for extended noncontextuality in general sets of random variables (Q4583102) (← links)
• The Boolean Quadric Polytope (Q5050144) (← links)
• Quantum Annealing versus Digital Computing (Q5102052) (← links)
• Target Cuts from Relaxed Decision Diagrams (Q5138261) (← links)
• Faster exact solution of sparse maxcut and QUBO problems (Q6095734) (← links)