Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-017-1134-7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On the extension complexity of combinatorial polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of 0/1 polytopes with high semidefinite extension complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear vs. semidefinite extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations for polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest compact formulation for the permutahedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifts of Convex Sets and Cone Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representation of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Representation of Convex Sets and Convex Hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear matrix inequality representation of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof that the extension complexity of the correlation polytope grows exponentially / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3343924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Size of Semidefinite Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension Complexity of Polytopes with Few Vertices or Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the extension complexity of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some \(0/1\) polytopes need exponential size extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matching Polytope has Exponential Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls of curves of genus one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-017-1134-7 / rank
 
Normal rank

Latest revision as of 04:55, 11 December 2024

scientific article
Language Label Description Also known as
English
Maximum semidefinite and linear extension complexity of families of polytopes
scientific article

    Statements

    Maximum semidefinite and linear extension complexity of families of polytopes (English)
    0 references
    0 references
    0 references
    0 references
    28 February 2018
    0 references
    semidefinite extended formulations
    0 references
    extension complexity
    0 references
    polytopes
    0 references

    Identifiers

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