The minimal average cost flow problem (Q1130071): Difference between revisions

@@ Property / cites work @@
+Multicommodity network flows—A survey
@@ Property / cites work: Multicommodity network flows—A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Canceling most helpful total cuts for minimum cost network flow
+Normal rank
@@ Property / cites work @@
+A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
+Normal rank
@@ Property / cites work @@
+An             <i>O</i>             (n             <sup>2</sup>             (m +             <i>N</i>             log             <i>n</i>             )log             <i>n</i>             ) min-cost flow algorithm
+Normal rank
@@ Property / cites work @@
+Multi-Terminal Network Flows
@@ Property / cites work: Multi-Terminal Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+A minimum concave-cost dynamic network flow problem with an application to lot-sizing
+Normal rank
@@ Property / cites work @@
+A Survey of Linear Cost Multicommodity Network Flows
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization of the flow through networks with gains
+Normal rank
@@ Property / cites work @@
+Q3802859
@@ Property / cites work: Q3802859 / rank @@
+Normal rank
@@ Property / cites work @@
+A strongly polynomial minimum cost circulation algorithm
+Normal rank