Lifting and separation procedures for the cut polytope (Q403653): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ABACUS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973648690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook on semidefinite, conic and polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-party Bell inequalities derived from combinatorics via triangular elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating facets for the cut polytope of a graph by triangular elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cuts and matchings in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local cuts revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating subdivision of bicycle wheel inequalities over cut polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting facets of the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact ground states of two-dimensional \(\pm J\) Ising spin glasses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-third-integrality in the max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4668573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Convenient Method for Generating Normal Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Relaxations for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank

Latest revision as of 22:54, 8 July 2024

scientific article
Language Label Description Also known as
English
Lifting and separation procedures for the cut polytope
scientific article

    Statements

    Lifting and separation procedures for the cut polytope (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 August 2014
    0 references
    max-cut problem
    0 references
    cut polytope
    0 references
    separation algorithm
    0 references
    branch-and-cut
    0 references
    unconstrained Boolean quadratic programming
    0 references
    Ising spin Glass model
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references