Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(11 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-008-9218-7 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: MIPLIB2003 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MIPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-008-9218-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2109933087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected Chvátal-Gomory cuts for mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts / 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: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing over the first Chvátal closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mod‐2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets / 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: Q5645210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable multi-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycles and the stable multi-set polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cutting Planes / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-008-9218-7 / rank
 
Normal rank

Latest revision as of 04:36, 10 December 2024

scientific article
Language Label Description Also known as
English
Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
scientific article

    Statements

    Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 August 2009
    0 references
    \(\{0,\frac {1}{2}\}\)-Chvátal-Gomory cuts
    0 references
    separation algorithms
    0 references
    integer programming
    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