Continuous and discrete flows over time
From MaRDI portal
Publication:634790
DOI10.1007/s00186-011-0357-2zbMath1228.90097OpenAlexW1514736078MaRDI QIDQ634790
Martin Skutella, Ebrahim Nasrabadi, Ronald Koch
Publication date: 16 August 2011
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-011-0357-2
Related Items
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period, Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies, On Verifying and Maintaining Connectivity of Interval Temporal Networks, The complexity of optimal design of temporally connected graphs, Dynamic flows with time-dependent capacities, Scheduling arc maintenance jobs in a network to maximize total flow over time, Temporal flows in temporal networks, Continuous and discrete flows over time, Unnamed Item, Unnamed Item, A polynomial time algorithm for the minimum flow problem in time-varying networks, Flows over time in time-varying networks: optimality conditions and strong duality, Robust flows over time: models and complexity results, A survey on models and algorithms for discrete evacuation planning network problems, Fleet management for autonomous vehicles using flows in time-expanded networks, Dynamic Atomic Congestion Games with Seasonal Flows, FIFO and randomized competitive packet routing games
Cites Work
- Continuous and discrete flows over time
- A survey of dynamic network flows
- Efficient continuous-time dynamic network flow algorithms
- An Introduction to Network Flows over Time
- A Class of Continuous Network Flow Problems
- Continuous-Time Shortest Path Problems and Linear Programming
- Introdction to Measure and Probability
- Continuous-Time Flows in Networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
