Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(92)90048-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2065932050
@@ Property / OpenAlex ID: W2065932050 / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Weintraub’s Minimum-Cost Circulation Algorithm
+Normal rank
@@ Property / cites work @@
+Q5523467
@@ Property / cites work: Q5523467 / rank @@
+Normal rank
@@ Property / cites work @@
+A dual algorithm for submodular flow problems
@@ Property / cites work: A dual algorithm for submodular flow problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5583694
@@ Property / cites work: Q5583694 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4094996
@@ Property / cites work: Q4094996 / rank @@
+Normal rank
@@ Property / cites work @@
+Canceling most helpful total cuts for minimum cost network flow
+Normal rank
@@ Property / cites work @@
+Finding minimum-cost circulations by canceling negative cycles
+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 @@
+A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
+Normal rank
@@ Property / cites work @@
+Computing maximum mean cuts
@@ Property / cites work: Computing maximum mean cuts / rank @@
+Normal rank
@@ Property / cites work @@
+A Primal Algorithm to Solve Network Flow Problems with Convex Costs
+Normal rank
@@ Property / cites work @@
+A bad network problem for the simplex method and other minimum cost flow algorithms
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1200795