Minimum-Cost Flows Over Time

06/01/2022

∙

In this paper we show that every maximum minimum-cost flow over time problem has an optimal solution with a repeated structure if the given time horizon is large enough.

READ FULL TEXT

Minimum-Cost Flows Over Time

A Note on the Quickest Minimum Cost Transshipment Problem

Finding all minimum cost flows and a faster algorithm for the K best flow problem

Algorithms for flows over time with scheduling costs

Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs

Optimally Reliable Cheap Payment Flows on the Lightning Network

Optimizing Data Intensive Flows for Networks on Chips

Cooperation in lot-sizing problems with heterogeneous costs: the effect of consolidated periods

Minimum-Cost Flows Over Time

Related Research

A Note on the Quickest Minimum Cost Transshipment Problem

Finding all minimum cost flows and a faster algorithm for the K best flow problem

Algorithms for flows over time with scheduling costs

Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs

Optimally Reliable Cheap Payment Flows on the Lightning Network

Optimizing Data Intensive Flows for Networks on Chips

Cooperation in lot-sizing problems with heterogeneous costs: the effect of consolidated periods