Lift and project relaxations for the matching and related polytopes (Q1421469): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5635469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Representation of the Matching Polytope Via Semidefinite Liftings / rank
 
Normal rank

Latest revision as of 13:18, 6 June 2024

scientific article
Language Label Description Also known as
English
Lift and project relaxations for the matching and related polytopes
scientific article

    Statements

    Lift and project relaxations for the matching and related polytopes (English)
    0 references
    0 references
    0 references
    0 references
    26 January 2004
    0 references
    Matching
    0 references
    Covering
    0 references
    Polyhedral combinatorics
    0 references
    Sequential tightening
    0 references
    procedures
    0 references

    Identifiers