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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q57702363, #quickstatements; #temporary_batch_1711565664090
Property / Wikidata QID
 
Property / Wikidata QID: Q57702363 / rank
 
Normal rank

Revision as of 20:29, 27 March 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