Design and verify: a new scheme for generating cutting-planes (Q2248750): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/s10107-013-0645-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2161499187 / 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: 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: Cutting-plane proofs in polynomial space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Matrix-Cut Rank of Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal closures for mixed integer programming 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 rank of mixed 0,1 polyhedra. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Chvátal-Gomory Closure of a Compact Convex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Chvátal-Gomory Closure of a Strictly Convex Body / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Verify: A New Scheme for Generating Cutting-Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between facets of low- and high-dimensional group problems / 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: Q4733665 / 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: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rank of Cutting-Plane Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank

Latest revision as of 17:12, 8 July 2024

scientific article
Language Label Description Also known as
English
Design and verify: a new scheme for generating cutting-planes
scientific article

    Statements

    Design and verify: a new scheme for generating cutting-planes (English)
    0 references
    0 references
    0 references
    27 June 2014
    0 references
    0 references
    verification scheme
    0 references
    cutting planes
    0 references
    integer programming
    0 references
    0 references