Note on the complexity of the mixed-integer hull of a polyhedron (Q1785359): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integer points in polyhedra: A lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integer points in 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: Q4401010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for Global Concave Minimization: A Bibliographic Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The upper bound theorem for polytopes: An easy proof of its asymptotic version / rank
 
Normal rank

Latest revision as of 16:47, 16 July 2024

scientific article
Language Label Description Also known as
English
Note on the complexity of the mixed-integer hull of a polyhedron
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references