A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310): 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/j.cor.2017.02.019
+Normal rank
@@ Property / OpenAlex ID @@
+W2594925297
@@ Property / OpenAlex ID: W2594925297 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Programming
@@ Property / cites work: Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+About the minimum mean cycle-canceling algorithm
@@ Property / cites work: About the minimum mean cycle-canceling algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Finding minimum-cost circulations by canceling negative cycles
+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 @@
+Minimum-cost flow algorithms: an experimental evaluation
+Normal rank
@@ Property / cites work @@
+Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+Tight bounds on the number of minimum-mean cycle cancellations and related results
+Normal rank