Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2017.10.001 / rank
Normal rank
 
Property / author
 
Property / author: Tunçel, Levent / rank
Normal rank
 
Property / author
 
Property / author: Tunçel, Levent / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963134868 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1608.07647 / 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: A Comprehensive Analysis of Polyhedral Lift-and-Project Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Algebra Lift Operators for 0-1 Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cutting-plane proofs in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Matrix-Cut Rank of Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the Lasserre Ranks of Some Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rank of Cutting-Plane Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and verify: a new scheme for generating cutting-planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes from extended LP formulations / 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: Improved Approximation Guarantees through Higher Levels of SDP Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theta Bodies for Polynomial Ideals / 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: A new lift-and-project operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2017.10.001 / rank
 
Normal rank

Latest revision as of 01:45, 11 December 2024

scientific article
Language Label Description Also known as
English
Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators
scientific article

    Statements

    Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (English)
    0 references
    0 references
    0 references
    17 August 2018
    0 references
    combinatorial optimization
    0 references
    lift-and-project methods
    0 references
    integrality gap
    0 references
    integer programming
    0 references
    semidefinite programming
    0 references
    convex relaxations
    0 references
    0 references
    0 references
    0 references

    Identifiers

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