Extended formulations for sparsity matroids (Q304267): Difference between revisions

@@ Property / arXiv ID @@
+.7272
@@ Property / arXiv ID: 1403.7272 / rank @@
+Normal rank
@@ Property / cites work @@
+Subgraph polytopes and independence polytopes of count matroids
+Normal rank
@@ Property / cites work @@
+Matroids and the greedy algorithm
@@ Property / cites work: Matroids and the greedy algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Extended formulations, nonnegative factorizations, and randomized communication protocols
+Normal rank
@@ Property / cites work @@
+Smallest compact formulation for the permutahedron
+Normal rank
@@ Property / cites work @@
+On the degrees of the vertices of a directed graph
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
+Normal rank
@@ Property / cites work @@
+Some \(0/1\) polytopes need exponential size extended formulations
+Normal rank
@@ Property / cites work @@
+On graphs and rigidity of plane skeletal structures
+Normal rank
@@ Property / cites work @@
+Using separation algorithms to generate mixed integer model reformulations
+Normal rank
@@ Property / cites work @@
+Decomposition of regular matroids
@@ Property / cites work: Decomposition of regular matroids / rank @@
+Normal rank
@@ Property / cites work @@
+Natural realizations of sparsity matroids
@@ Property / cites work: Natural realizations of sparsity matroids / rank @@
+Normal rank
@@ Property / cites work @@
+Rigidity of multi-graphs. I: Linking rigid bodies in n-space
+Normal rank
@@ Property / cites work @@
+A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs
+Normal rank