Lifting and separation procedures for the cut polytope
From MaRDI portal
(Redirected from Publication:403653)
Recommendations
- Lifting facets of the cut polytope
- A polyhedral study of lifted multicuts
- Cutting a polytope
- scientific article; zbMATH DE number 3885658
- Facets and lifting procedures for the set covering polytope
- Lifting of parallelohedra
- On the cut polytope
- scientific article; zbMATH DE number 742976
- Separation and approximation of polyhedral objects
- scientific article; zbMATH DE number 1629819
Cites work
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- scientific article; zbMATH DE number 780784 (Why is no real title available?)
- A Convenient Method for Generating Normal Variables
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- An Interior-Point Method for Semidefinite Programming
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- Exact ground states of two-dimensional \(\pm J\) Ising spin glasses
- Generating facets for the cut polytope of a graph by triangular elimination
- Geometry of cuts and metrics
- Handbook on semidefinite, conic and polynomial optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Lifting facets of the cut polytope
- Local cuts revisited
- New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities
- On cuts and matchings in planar graphs
- On the cut polytope
- One-third-integrality in the max-cut problem
- Semidefinite relaxations for integer programming
- Separating subdivision of bicycle wheel inequalities over cut polytopes
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- The traveling salesman problem. A computational study.
- Two-party Bell inequalities derived from combinatorics via triangular elimination
Cited in
(21)- Generalised 2-circulant inequalities for the max-cut problem
- Efficient semidefinite branch-and-cut for MAP-MRF inference
- Quantum annealing versus digital computing. An experimental comparison
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results
- Faster exact solution of sparse maxcut and QUBO problems
- Necessary conditions for extended noncontextuality in general sets of random variables
- A new separation algorithm for the Boolean quadric and cut polytopes
- Retracts and algebraic properties of cut algebras
- Seminormality, canonical modules, and regularity of cut polytopes
- A polyhedral study of lifted multicuts
- A note on the 2-circulant inequalities for the MAX-cut problem
- Coordinated cutting plane generation via multi-objective separation
- Collapsing and lifting for the cut cone
- Target cuts from relaxed decision diagrams
- The Boolean quadric polytope
- Generalized cut and metric polytopes of graphs and simplicial complexes
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Local search inequalities
- General cut-generating procedures for the stable set polytope
- The hypermetric cone and polytope on eight vertices and some generalizations
This page was built for publication: Lifting and separation procedures for the cut polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403653)
