Geometric proofs for convex hull defining formulations (Q1755829): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2016.07.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2468402902
@@ Property / OpenAlex ID: W2468402902 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q113867745
@@ Property / Wikidata QID: Q113867745 / rank @@
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+Subset Algebra Lift Operators for 0-1 Integer Programming
+Normal rank
@@ Property / cites work @@
+On integer polytopes with few nonzero vertices
@@ Property / cites work: On integer polytopes with few nonzero vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Q4537750
@@ Property / cites work: Q4537750 / rank @@
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank