Continuous and discrete flows over time

DOI10.1007/S00186-011-0357-2MaRDI QIDQ634790zbMATH OpenOpenAlexFDO

Authors Ronald Koch, Ebrahim Nasrabadi, Martin Skutella

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

zbMATH Keywords

flows over timeMaxFlow-MinCutmeasure theorynetwork flows

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Strong Duality for the Maximum Borel Flow Problem
• Continuous-Time Flows in Networks
• On continuous network flows
• An introduction to network flows over time
• On solving continuous-time dynamic network flows

Cites work

• A Class of Continuous Network Flow Problems
• A survey of dynamic network flows
• An introduction to network flows over time
• Continuous and discrete flows over time
• Continuous-Time Flows in Networks
• Continuous-Time Shortest Path Problems and Linear Programming
• Dynamic flows in time-varying networks.
• Efficient continuous-time dynamic network flow algorithms
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 4029251 (Why is no real title available?)
• scientific article; zbMATH DE number 3484308 (Why is no real title available?)
• scientific article; zbMATH DE number 3245885 (Why is no real title available?)
• scientific article; zbMATH DE number 956788 (Why is no real title available?)
• Introdction to Measure and Probability

Cited in

(21)

• A polynomial time algorithm for the minimum flow problem in time-varying networks
• Robust flows over time: models and complexity results
• On continuous network flows
• FIFO and randomized competitive packet routing games
• Flows over time in time-varying networks: optimality conditions and strong duality
• The complexity of optimal design of temporally connected graphs
• A survey on models and algorithms for discrete evacuation planning network problems
• Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
• scientific article; zbMATH DE number 3842833 (Why is no real title available?)
• Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies
• Incremental flow
• scientific article; zbMATH DE number 5574999 (Why is no real title available?)
• Scheduling arc maintenance jobs in a network to maximize total flow over time
• Towards a theory of continuous flow models
• Dynamic Atomic Congestion Games with Seasonal Flows
• Dynamic network contraflow evacuation planning problem with continuous time approach
• A critical survey on the network optimization algorithms for evacuation planning problems
• On verifying and maintaining connectivity of interval temporal networks
• Fleet management for autonomous vehicles using flows in time-expanded networks
• Dynamic flows with time-dependent capacities
• Continuous and discrete flows over time

This page was built for publication: Continuous and discrete flows over time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q634790)