Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube (Q635513): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Chvátal rank of polytopes in the 0/1 cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Chvátal rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and a hierarchy of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cutting-plane proofs in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Chvatal rank of polytopes in the 0/1-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank

Latest revision as of 10:31, 4 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
scientific article

    Statements

    Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube (English)
    0 references
    0 references
    0 references
    19 August 2011
    0 references
    0 references
    Chvàtal-gomory procedure
    0 references
    rank lower bounds
    0 references
    cutting-plane procedures
    0 references
    0 references