On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1436457511 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1706.05496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension complexity of stable set polytopes of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berge trigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring perfect graphs with bounded clique number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring perfect graphs with no balanced skew-partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-cutsets and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets and graphs with no even holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositions for perfect graphs / 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: Exponential Lower Bounds for Polytopes in Combinatorial Optimization / 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: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Skew Partition Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using separation algorithms to generate mixed integer model reformulations / 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: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the perfect graph conjecture / 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: Combinatorial optimization with 2-joins / rank
 
Normal rank

Latest revision as of 20:55, 19 July 2024

scientific article
Language Label Description Also known as
English
On the linear extension complexity of stable set polytopes for perfect graphs
scientific article

    Statements

    On the linear extension complexity of stable set polytopes for perfect graphs (English)
    0 references
    0 references
    0 references
    10 July 2019
    0 references
    0 references
    basic perfect graphs
    0 references
    stable set polytopes of perfect graphs
    0 references
    0 references
    0 references
    0 references
    0 references