Algorithms for flows over time with scheduling costs

DOI10.1007/s10107-021-01725-zzbMath1489.90153OpenAlexW4210604729MaRDI QIDQ2118123

Neil Olver, Dario Frascaria

Publication date: 22 March 2022

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-021-01725-z

zbMATH Keywords

trafficflows over timetolls

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Traffic problems in operations research (90B20) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nash equilibria and the price of anarchy for flows over time
• Transient flows in networks
• Optimality conditions and duality in continuous programming. II: The linear problem revisited
• Duality in infinite dimensional linear programming
• Efficient continuous-time dynamic network flow algorithms
• Long term behavior of dynamic equilibria in fluid queuing networks
• An Introduction to Network Flows over Time
• Dynamic Equilibria in Fluid Queueing Networks
• Traffic Networks and Flows over Time
• Note—Some Equivalent Objectives for Dynamic Network Flow Problems
• Maximal, Lexicographic, and Dynamic Network Flows
• The Simplex Algorithm Is NP-Mighty
• A bad network problem for the simplex method and other minimum cost flow algorithms
• Nash Flows Over Time with Spillback
• Constructing Maximal Dynamic Flows from Static Flows
• Algorithmic Game Theory
• An Algorithm for Universal Maximal Dynamic Flows in a Network
• Continuous-Time Flows in Networks

This page was built for publication: Algorithms for flows over time with scheduling costs