Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility (Q3833848): Difference between revisions

← Older edit

@@ Property / DOI @@
-.1093/imaman/1.2.99
@@ Property / DOI: 10.1093/imaman/1.2.99 / rank @@
-Normal rank
@@ Property / DOI @@
+.1093/IMAMAN/1.2.99
@@ Property / DOI: 10.1093/IMAMAN/1.2.99 / rank @@
+Normal rank
@@ Property / Recommended article @@
+How to compute least infeasible flows
@@ Property / Recommended article: How to compute least infeasible flows / rank @@
+Normal rank
+Similarity Score: 0.8704464Amount 0.8704464
Unit 1
-Amount
+.8704464
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A new algorithm for solving the feasibility problem of a network flow
+Normal rank
+Similarity Score: 0.8644639Amount 0.8644639
Unit 1
-Amount
+.8644639
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem
+Normal rank
+Similarity Score: 0.8632068Amount 0.8632068
Unit 1
-Amount
+.8632068
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q5294046
@@ Property / Recommended article: Q5294046 / rank @@
+Normal rank
@@ Property / Recommended article: Q5294046 / qualifier @@
+Similarity Score: 0.8622753Amount 0.8622753
Unit 1
-Amount
+.8622753
 Unit
@@ Property / Recommended article: Q5294046 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A new strongly polynomial dual network simplex algorithm
+Normal rank
+Similarity Score: 0.8587611Amount 0.8587611
Unit 1
-Amount
+.8587611
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q3320095
@@ Property / Recommended article: Q3320095 / rank @@
+Normal rank
@@ Property / Recommended article: Q3320095 / qualifier @@
+Similarity Score: 0.8475017Amount 0.8475017
Unit 1
-Amount
+.8475017
 Unit
@@ Property / Recommended article: Q3320095 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q3995028
@@ Property / Recommended article: Q3995028 / rank @@
+Normal rank
@@ Property / Recommended article: Q3995028 / qualifier @@
+Similarity Score: 0.8443897Amount 0.8443897
Unit 1
-Amount
+.8443897
 Unit
@@ Property / Recommended article: Q3995028 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A unified framework for primal-dual methods in minimum cost network flow problems
+Normal rank
+Similarity Score: 0.8436112Amount 0.8436112
Unit 1
-Amount
+.8436112
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
+Normal rank
+Similarity Score: 0.8420117Amount 0.8420117
Unit 1
-Amount
+.8420117
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q3798455
@@ Property / Recommended article: Q3798455 / rank @@
+Normal rank
@@ Property / Recommended article: Q3798455 / qualifier @@
+Similarity Score: 0.8395926Amount 0.8395926
Unit 1
-Amount
+.8395926
 Unit
@@ Property / Recommended article: Q3798455 / qualifier @@
+Recommender Run: Recommender Run 2