On the combinatorial lower bound for the extension complexity of the spanning tree polytope (Q2417165): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2586559425
@@ Property / OpenAlex ID: W2586559425 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5684698
@@ Property / cites work: Q5684698 / rank @@
+Normal rank
@@ Property / cites work @@
+Extended formulations, nonnegative factorizations, and randomized communication protocols
+Normal rank
@@ Property / cites work @@
+Combinatorial bounds on nonnegative rank and extended formulations
+Normal rank
@@ Property / cites work @@
+Exponential Lower Bounds for Polytopes in Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Fooling sets and the spanning tree polytope
@@ Property / cites work: Fooling sets and the spanning tree polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Using separation algorithms to generate mixed integer model reformulations
+Normal rank
@@ Property / cites work @@
+Symmetry Matters for Sizes of Extended Formulations
+Normal rank
@@ Property / cites work @@
+The (minimum) rank of typical fooling-set matrices
+Normal rank
@@ Property / cites work @@
+The Matching Polytope has Exponential Extension Complexity
+Normal rank
@@ Property / cites work @@
+Expressing combinatorial optimization problems by linear programs
+Normal rank
@@ Property / Wikidata QID @@
+Q130034043
@@ Property / Wikidata QID: Q130034043 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2417165