Penelope's graph: a hard minimum cost tension instance (Q1127551): Difference between revisions

@@ Property / cites work @@
+Q3236245
@@ Property / cites work: Q3236245 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+An Out-of-Kilter Method for Minimal-Cost Flow Problems
+Normal rank
@@ Property / cites work @@
+Flots et tensions dans un graphe
@@ Property / cites work: Flots et tensions dans un graphe / rank @@
+Normal rank
@@ Property / cites work @@
+Finding minimum-cost circulations by canceling negative cycles
+Normal rank
@@ Property / cites work @@
+Penelope's graph: a hard minimum cost tension instance
+Normal rank
@@ Property / cites work @@
+A strongly polynomial algorithm for the minimum cost tension problem
+Normal rank
@@ Property / cites work @@
+Miu Cost Tensions
@@ Property / cites work: Miu Cost Tensions / rank @@
+Normal rank
@@ Property / cites work @@
+A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
+Normal rank
@@ Property / cites work @@
+Q4077762
@@ Property / cites work: Q4077762 / rank @@
+Normal rank
@@ Property / cites work @@
+Monotone networks
@@ Property / cites work: Monotone networks / rank @@
+Normal rank
@@ Property / cites work @@
+An “out-of-kilter” algorithm for solving minimum cost potential problems
+Normal rank
@@ Property / cites work @@
+A strongly polynomial minimum cost circulation algorithm
+Normal rank
@@ Property / cites work @@
+On some techniques useful for solution of transportation network problems
+Normal rank
@@ Property / cites work @@
+A bad network problem for the simplex method and other minimum cost flow algorithms
+Normal rank