Design and Verify: A New Scheme for Generating Cutting-Planes (Q3009757): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Santanu S. Dey / rank
Normal rank
 
Property / author
 
Property / author: Santanu S. Dey / 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/978-3-642-20807-2_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2177576089 / 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: On the rank of mixed 0,1 polyhedra. / 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: Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two row mixed-integer cuts via lifting / 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: The Cutting-Plane Method for Solving Convex Programs / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:43, 4 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
    24 June 2011
    0 references
    0 references
    verification scheme
    0 references
    cutting-planes
    0 references
    integer programming
    0 references
    0 references