Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972): Difference between revisions

@@ Property / cites work @@
+Q4040780
@@ Property / cites work: Q4040780 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster algorithms for the shortest path problem
@@ Property / cites work: Faster algorithms for the shortest path problem / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Time Bounds for the Maximum Flow Problem
@@ Property / cites work: Improved Time Bounds for the Maximum Flow Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Reducing Matching to Polynomial Size Linear Programming
+Normal rank
@@ Property / cites work @@
+Q3277097
@@ Property / cites work: Q3277097 / rank @@
+Normal rank
@@ Property / cites work @@
+The auction algorithm: A distributed relaxation method for the assignment problem
+Normal rank
@@ Property / cites work @@
+On the computational behavior of a polynomial-time network flow algorithm
+Normal rank
@@ Property / cites work @@
+Q4083324
@@ Property / cites work: Q4083324 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079613
@@ Property / cites work: Q4079613 / rank @@
+Normal rank
@@ Property / cites work @@
+Sensitivity theorems in integer linear programming
+Normal rank
@@ Property / cites work @@
+Q3236245
@@ Property / cites work: Q3236245 / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Q4094996
@@ Property / cites work: Q4094996 / rank @@
+Normal rank
@@ Property / cites work @@
+Two strongly polynomial cut cancelling algorithms for minimum cost network flow
+Normal rank
@@ Property / cites work @@
+Canceling most helpful total cuts for minimum cost network flow
+Normal rank
@@ Property / cites work @@
+Q5514188
@@ Property / cites work: Q5514188 / rank @@
+Normal rank
@@ Property / cites work @@
+A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
+Normal rank
@@ Property / cites work @@
+An Out-of-Kilter Method for Minimal-Cost Flow Problems
+Normal rank
@@ Property / cites work @@
+Scaling algorithms for network problems
@@ Property / cites work: Scaling algorithms for network problems / rank @@
+Normal rank
@@ Property / cites work @@
+An             <i>O</i>             (n             <sup>2</sup>             (m +             <i>N</i>             log             <i>n</i>             )log             <i>n</i>             ) min-cost flow algorithm
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Finding minimum-cost circulations by canceling negative cycles
+Normal rank
@@ Property / cites work @@
+Finding Minimum-Cost Circulations by Successive Approximation
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
+Normal rank
@@ Property / cites work @@
+Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
+Normal rank
@@ Property / cites work @@
+Q3274170
@@ Property / cites work: Q3274170 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of the minimum cycle mean in a digraph
+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 @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing maximum mean cuts
@@ Property / cites work: Computing maximum mean cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Q4283444
@@ Property / cites work: Q4283444 / rank @@
+Normal rank
@@ Property / cites work @@
+Monotone networks
@@ Property / cites work: Monotone networks / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
+Normal rank
@@ Property / cites work @@
+Q3291034
@@ Property / cites work: Q3291034 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763405
@@ Property / cites work: Q4763405 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138945
@@ Property / cites work: Q3138945 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3908745
@@ Property / cites work: Q3908745 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5638111
@@ Property / cites work: Q5638111 / rank @@
+Normal rank
@@ Property / cites work @@
+A strongly polynomial minimum cost circulation algorithm
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank