An analytic symmetrization of max flow-min cut (Q1356775): Difference between revisions

@@ Property / author @@
+Manfred W. Padberg
@@ Property / author: Manfred W. Padberg / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The perfectly matchable subgraph polytope of a bipartite graph
+Normal rank
@@ Property / cites work @@
+The perfectly matchable subgraph polytope of an arbitrary graph
+Normal rank
@@ Property / cites work @@
+Q3844775
@@ Property / cites work: Q3844775 / 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 @@
+Q5514188
@@ Property / cites work: Q5514188 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5620998
@@ Property / cites work: Q5620998 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4082546
@@ Property / cites work: Q4082546 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+On the width—length inequality
@@ Property / cites work: On the width—length inequality / rank @@
+Normal rank
@@ Property / cites work @@
+Linear optimization and extensions
@@ Property / cites work: Linear optimization and extensions / rank @@
+Normal rank
@@ Property / cites work @@
+An analytical comparison of different formulations of the travelling salesman problem
+Normal rank