Minimum-Cost Flows Over Time
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.