Minimum-Cost Flows Over Time
Optimization and Control
2022-06-02 v1 Data Structures and 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.
Cite
@article{arxiv.2206.00526,
title = {Minimum-Cost Flows Over Time},
author = {Miriam Schlöter and Robert Weismantel},
journal= {arXiv preprint arXiv:2206.00526},
year = {2022}
}
Related papers
View all related →
Data Structures and Algorithms · Computer Science
Minimum-Peak-Cost Flows Over Time
Mariia Anapolska, Emma Ahrens, Christina Büsing, Felix Engelhardt +4
2025-07-16
Optimization and Control · Mathematics
Cost-Flow Summation Algorithm Based on Table Form to Solve Minimum Cost-Flow Problem
Eghbal Hosseini
2021-01-05
Data Structures and Algorithms · Computer Science
On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
2016-07-11
Optimization and Control · Mathematics
Modeling Minimum Cost Network Flows With Port-Hamiltonian Systems
Onur Tanil Doganay, Kathrin Klamroth, Bruno Lang, Michael Stiglmayr +1
2023-03-24
Data Structures and Algorithms · Computer Science
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng +2
2022-04-26
Data Structures and Algorithms · Computer Science
Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm
Dorit S. Hochbaum
2025-07-30
Data Structures and Algorithms · Computer Science
Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
Nithin Kavi
2024-07-16
Data Structures and Algorithms · Computer Science
Algorithms for flows over time with scheduling costs
Dario Frascaria, Neil Olver
2019-12-03
Probability · Mathematics
Optimal flow through the disordered lattice
David Aldous
2011-11-09
Logic in Computer Science · Computer Science
A Formal Analysis of Capacity Scaling Algorithms for Minimum-Cost Flows
Mohammad Abdulaziz, Thomas Ammer
2026-02-04
Data Structures and Algorithms · Computer Science
Yet another approach to the Maximum Flow
Björn Hlava
2013-02-14
Data Structures and Algorithms · Computer Science
Faster Sparse Minimum Cost Flow by Electrical Flow Localization
Kyriakos Axiotis, Aleksander Mądry, Adrian Vladu
2021-11-22
Discrete Mathematics · Computer Science
A Note on the Quickest Minimum Cost Transshipment Problem
Martin Skutella
2023-03-07
Data Structures and Algorithms · Computer Science
Minimum Cost Flows, MDPs, and $\ell_1$-Regression in Nearly Linear Time for Dense Instances
Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak +3
2021-08-24
Machine Learning · Computer Science
A machine learning based algorithm selection method to solve the minimum cost flow problem
Philipp Herrmann, Anna Meyer, Stefan Ruzika, Luca E. Schäfer +1
2022-10-06
Discrete Mathematics · Computer Science
Abstract flows over time: A first step towards solving dynamic packing problems
Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis
2012-11-13
Data Structures and Algorithms · Computer Science
A Network Simplex Method for the Budget-Constrained Minimum Cost Flow Problem
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
2017-11-16
Differential Geometry · Mathematics
Multitime maximum principle approach of minimal submanifolds and harmonic maps
Constantin Udriste
2011-10-24
Optimization and Control · Mathematics
Remarks on finite and infinite time-horizon optimal control problems
Sérgio S. Rodrigues
2022-12-06
Discrete Mathematics · Computer Science
Robust Flows over Time: Models and Complexity Results
Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis +2
2018-05-07
Databases · Computer Science
Cost optimization of data flows based on task re-ordering
Georgia Kougka, Anastasios Gounaris
2015-07-31
Systems and Control · Computer Science
Flows over time in time-varying networks
Ebrahim Nasrabadi, Ronald Koch
2014-01-24
Data Structures and Algorithms · Computer Science
A Combinatorial $\tilde{O}(m^{3/2})$-time Algorithm for the Min-Cost Flow Problem
Ruben Becker, Andreas Karrenbauer
2014-02-19
Data Structures and Algorithms · Computer Science
Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs
Per Joachims, Max Klimm, Philipp Warode
2022-03-25
Combinatorics · Mathematics
On the Bicriterion Maximum Flow Network Interdiction Problem
Luca E. Schäfer, Stefan Ruzika, Sven O. Krumke, Carlos M. Fonseca
2020-10-09