Minimum-Cost Flows Over Time

TL;DR

This paper demonstrates that maximum minimum-cost flow over time problems have structured optimal solutions when the time horizon is sufficiently large, revealing insights into their solution patterns.

Contribution

It introduces the concept of repeated structure in optimal solutions for maximum minimum-cost flow over time problems with large time horizons.

Findings

Optimal solutions exhibit a repeated pattern for large time horizons.

The structure simplifies the analysis and computation of solutions.

Provides theoretical foundation for efficient algorithms.

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.