On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency (Q2638384): Difference between revisions

@@ Property / cites work @@
+Small Min-Cut Polyhedra
@@ Property / cites work: Small Min-Cut Polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934581
@@ Property / cites work: Q2934581 / rank @@
+Normal rank
@@ Property / cites work @@
+On the cut polyhedron.
@@ Property / cites work: On the cut polyhedron. / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+A Suggested Computation for Maximal Multi-Commodity Network Flows
+Normal rank
@@ Property / cites work @@
+Q5620998
@@ Property / cites work: Q5620998 / rank @@
+Normal rank
@@ Property / cites work @@
+Blocking and anti-blocking pairs of polyhedra
@@ Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234149
@@ Property / cites work: Q4234149 / rank @@
+Normal rank
@@ Property / cites work @@
+A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank