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

@@ Property / DOI @@
-.1016/j.disopt.2017.10.001
@@ Property / DOI: 10.1016/j.disopt.2017.10.001 / rank @@
-Normal rank
@@ Property / author @@
+Tunçel, Levent
@@ Property / author: Tunçel, Levent / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963134868
@@ Property / OpenAlex ID: W2963134868 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.07647
@@ Property / arXiv ID: 1608.07647 / rank @@
+Normal rank
@@ Property / cites work @@
+Disjunctive programming: Properties of the convex hull of feasible points
+Normal rank
@@ Property / cites work @@
+A Comprehensive Analysis of Polyhedral Lift-and-Project Methods
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+Q4537750
@@ Property / cites work: Q4537750 / rank @@
+Normal rank
@@ Property / cites work @@
+Subset Algebra Lift Operators for 0-1 Integer Programming
+Normal rank
@@ Property / cites work @@
+On cutting-plane proofs in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q4537736
@@ Property / cites work: Q4537736 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Matrix-Cut Rank of Polyhedra
@@ Property / cites work: On the Matrix-Cut Rank of Polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
+Normal rank
@@ Property / cites work @@
+A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
+Normal rank
@@ Property / cites work @@
+Computation of the Lasserre Ranks of Some Polytopes
+Normal rank
@@ Property / cites work @@
+On the Rank of Cutting-Plane Proof Systems
@@ Property / cites work: On the Rank of Cutting-Plane Proof Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Design and verify: a new scheme for generating cutting-planes
+Normal rank
@@ Property / cites work @@
+On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy
+Normal rank
@@ Property / cites work @@
+Cutting planes from extended LP formulations
@@ Property / cites work: Cutting planes from extended LP formulations / rank @@
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
+Normal rank
@@ Property / cites work @@
+Q2913812
@@ Property / cites work: Q2913812 / rank @@
+Normal rank
@@ Property / cites work @@
+Theta Bodies for Polynomial Ideals
@@ Property / cites work: Theta Bodies for Polynomial Ideals / rank @@
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+A new lift-and-project operator
@@ Property / cites work: A new lift-and-project operator / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems.
+Normal rank
@@ Property / DOI @@
+.1016/J.DISOPT.2017.10.001
@@ Property / DOI: 10.1016/J.DISOPT.2017.10.001 / rank @@
+Normal rank