Extended formulations of lower-truncated transversal polymatroids (Q4999331): Difference between revisions

@@ Property / cites work @@
+Q4414632
@@ Property / cites work: Q4414632 / 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 @@
+Q3085455
@@ Property / cites work: Q3085455 / rank @@
+Normal rank
@@ Property / cites work @@
+NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
+Normal rank
@@ Property / cites work @@
+On combinatorial structures of line drawings of polyhedra
+Normal rank
@@ Property / cites work @@
+Extended formulations for sparsity matroids
@@ Property / cites work: Extended formulations for sparsity matroids / rank @@
+Normal rank
@@ Property / cites work @@
+Using separation algorithms to generate mixed integer model reformulations
+Normal rank
@@ Property / cites work @@
+Rado's theorem for polymatroids
@@ Property / cites work: Rado's theorem for polymatroids / rank @@
+Normal rank
@@ Property / cites work @@
+Some \(0/1\) polytopes need exponential size extended formulations
+Normal rank
@@ Property / cites work @@
+The Matching Polytope has Exponential Extension Complexity
+Normal rank
@@ Property / cites work @@
+Natural realizations of sparsity matroids
@@ Property / cites work: Natural realizations of sparsity matroids / rank @@
+Normal rank