Robust flows over time: models and complexity results
DOI10.1007/s10107-017-1170-3zbMath1405.90135arXiv1608.06520OpenAlexW2951921965MaRDI QIDQ1785195
Corinna Gottschalk, Frauke Liers, Daniel Schmand, Andreas Wierz, Britta Peis, Arie M. C. A. Koster
Publication date: 28 September 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.06520
Programming involving graphs or networks (90C35) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Flows in graphs (05C21)
Related Items (4)
Cites Work
- Unnamed Item
- Continuous and discrete flows over time
- A survey of dynamic network flows
- The directed subgraph homeomorphism problem
- The ellipsoid method and its consequences in combinatorial optimization
- Robust discrete optimization and network flows
- Deterministic network interdiction
- A decomposition theorem for partially ordered sets
- Evaluating Gas Network Capacities
- An Introduction to Network Flows over Time
- Efficient algorithms for interval graphs and circular-arc graphs
- Maximizing residual flow under an arc destruction
- Degree-Constrained Orientations of Embedded Graphs
- Reducibility among Combinatorial Problems
- Robust and Adaptive Network Flows
- Flows over Time with Load-Dependent Transit Times
- Constructing Maximal Dynamic Flows from Static Flows
- The maximum residual flow problem: NP‐hardness with two‐arc destruction
This page was built for publication: Robust flows over time: models and complexity results
