A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding minimum-cost flows by double scaling
@@ Property / cites work: Finding minimum-cost flows by double scaling / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Minimum-Cost Circulations by Successive Approximation
+Normal rank
@@ Property / cites work @@
+A Faster Strongly Polynomial Minimum Cost Flow Algorithm
+Normal rank
@@ Property / cites work @@
+A bad network problem for the simplex method and other minimum cost flow algorithms
+Normal rank
@@ Property / cites work @@
+Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
+Normal rank
@@ Property / cites work @@
+The Scaling Network Simplex Algorithm
@@ Property / cites work: The Scaling Network Simplex Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+A genuinely polynomial primal simplex algorithm for the assignment problem
+Normal rank
@@ Property / cites work @@
+Technical Note—A Polynomial Simplex Method for the Assignment Problem
+Normal rank
@@ Property / cites work @@
+On the simplex algorithm for networks and generalized networks
+Normal rank
@@ Property / cites work @@
+A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
+Normal rank
@@ Property / cites work @@
+Efficient Shortest Path Simplex Algorithms
@@ Property / cites work: Efficient Shortest Path Simplex Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Use of dynamic trees in a network simplex algorithm for the maximum flow problem
+Normal rank
@@ Property / cites work @@
+A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time
+Normal rank
@@ Property / cites work @@
+On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem
+Normal rank
@@ Property / cites work @@
+Q3138913
@@ Property / cites work: Q3138913 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial dual network simplex algorithms
@@ Property / cites work: Polynomial dual network simplex algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A new strongly polynomial dual network simplex algorithm
+Normal rank
@@ Property / cites work @@
+Polynomial-time primal simplex algorithms for the minimum cost network flow problem
+Normal rank
@@ Property / cites work @@
+Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
+Normal rank
@@ Property / cites work @@
+A strongly polynomial minimum cost circulation algorithm
+Normal rank
@@ Property / cites work @@
+A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
+Normal rank
@@ Property / cites work @@
+Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
+Normal rank
@@ Property / cites work @@
+A network simplex method
@@ Property / cites work: A network simplex method / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02614365
+Normal rank
@@ Property / OpenAlex ID @@
+W3139172074
@@ Property / OpenAlex ID: W3139172074 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1373741