Some \(0/1\) polytopes need exponential size extended formulations (Q2434987): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2159584454
@@ Property / OpenAlex ID: W2159584454 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0036
@@ Property / arXiv ID: 1105.0036 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
+Normal rank
@@ Property / cites work @@
+Disjunctive programming: Properties of the convex hull of feasible points
+Normal rank
@@ Property / cites work @@
+On cuts and matchings in planar graphs
@@ Property / cites work: On cuts and matchings in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate formulations for 0-1 knapsack sets
@@ Property / cites work: Approximate formulations for 0-1 knapsack sets / rank @@
+Normal rank
@@ Property / cites work @@
+Extended formulations in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q4432947
@@ Property / cites work: Q4432947 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Linear vs. semidefinite extended formulations
@@ Property / cites work: Linear vs. semidefinite extended formulations / rank @@
+Normal rank
@@ Property / cites work @@
+Extended formulations for polygons
@@ Property / cites work: Extended formulations for polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Parity, circuits, and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+An application of simultaneous diophantine approximation in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus
+Normal rank
@@ Property / cites work @@
+Smallest compact formulation for the permutahedron
+Normal rank
@@ Property / cites work @@
+Q3050157
@@ Property / cites work: Q3050157 / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetry Matters for the Sizes of Extended Formulations
+Normal rank
@@ Property / cites work @@
+Using separation algorithms to generate mixed integer model reformulations
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+On the Complexity of Nonnegative Matrix Factorization
+Normal rank
@@ Property / cites work @@
+Expressing combinatorial optimization problems by linear programs
+Normal rank
@@ Property / cites work @@
+Q4518979
@@ Property / cites work: Q4518979 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2434987