Smallest compact formulation for the permutahedron (Q745678): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds on nonnegative rank and extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear vs. semidefinite extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Lower Bounds on the Sizes of Symmetric Extensions of Permutahedra and Similar Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved sorting networks with O(log N) depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inequality / 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: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank

Latest revision as of 22:15, 10 July 2024

scientific article
Language Label Description Also known as
English
Smallest compact formulation for the permutahedron
scientific article

    Statements