How to compute least infeasible flows (Q1373747): Difference between revisions

@@ Property / cites work @@
+Diagnosing infeasibilities in network flow problems
+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 @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Weintraub’s Minimum-Cost Circulation Algorithm
+Normal rank
@@ Property / cites work @@
+On a routing problem
@@ Property / cites work: On a routing problem / 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 @@
+Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
+Normal rank
@@ Property / cites work @@
+Submodular functions and optimization
@@ Property / cites work: Submodular functions and optimization / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+Finding Minimum-Cost Circulations by Successive Approximation
+Normal rank
@@ Property / cites work @@
+Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
+Normal rank
@@ Property / cites work @@
+Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
+Normal rank
@@ Property / cites work @@
+Consistency, redundancy, and implied equalities in linear systems
+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 new saling algorithm for the maximum mean cut problem
+Normal rank
@@ Property / cites work @@
+Computing maximum mean cuts
@@ Property / cites work: Computing maximum mean cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate binary search algorithms for mean cuts and cycles
+Normal rank
@@ Property / cites work @@
+Q4763405
@@ Property / cites work: Q4763405 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2743974
@@ Property / cites work: Q2743974 / rank @@
+Normal rank
@@ Property / cites work @@
+A Primal Algorithm to Solve Network Flow Problems with Convex Costs
+Normal rank
@@ Property / cites work @@
+Faster parametric shortest path and minimum‐balance algorithms
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02614370
+Normal rank
@@ Property / OpenAlex ID @@
+W1968878023
@@ Property / OpenAlex ID: W1968878023 / rank @@
+Normal rank