Strengthening Chvátal-Gomory cuts and Gomory fractional cuts (Q1612007): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57702363, #quickstatements; #temporary_batch_1711565664090
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4398360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening cuts for mixed integer programs / 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: Q4147876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the separation of maximally violated mod-\(k\) cuts / 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: Elementary closures for integer programs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the membership problem for the elementary closure of a polyhedron / 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: Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some continuous functions related to corner polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some continuous functions related to corner polyhedra, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263714 / 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: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank

Latest revision as of 15:16, 4 June 2024

scientific article
Language Label Description Also known as
English
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
scientific article

    Statements

    Strengthening Chvátal-Gomory cuts and Gomory fractional cuts (English)
    0 references
    0 references
    0 references
    28 August 2002
    0 references
    This paper is concerned with a new technique for strengthening the Chvátal-Gomory cuts (and the closely related Gomory fractional cuts) for pure integer programming problems. The authors define these cuts and review some of the known procedures for strengthening them. Then they give the new procedure. Computational results illustrate the improvements which can be gained by using the new inequalities in place of the original ones.
    0 references
    cutting planes
    0 references
    Chvátal-Gomory cuts
    0 references
    Gomory fractional cuts
    0 references
    integer programming
    0 references
    inequalities
    0 references

    Identifiers