Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs (Q299078): 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: W750602481 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1504.07888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of the Perfect Graph Theorem Under the Disjunctive Index / 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: Strength of facets for the set covering and set packing polyhedra on circulant matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2861537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the behavior of the \(N_{+}\)-operator under blocker duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable Set Polytopes for a Class of Circulant Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rank facets of the stable set polytope for claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable set polyhedra for K//(1,3)free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Imperfection Ratio and Imperfection Index for Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable set problem and the lift-and-project ranks of graphs / 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: Clique family inequalities for the stable set polytope of quasi-line graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect zero–one matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost integral polyhedra related to certain combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Lehman's theorems to packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of facet producing graphs for vertex packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and semidefinite programming methods in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antiwebs are rank-perfect / rank
 
Normal rank

Latest revision as of 05:38, 12 July 2024

scientific article
Language Label Description Also known as
English
Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs
scientific article

    Statements

    Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs (English)
    0 references
    0 references
    0 references
    22 June 2016
    0 references
    polyhedral combinatorics
    0 references
    lift-and-project operators
    0 references
    webs
    0 references
    stable set polytope
    0 references

    Identifiers