Algorithms for Flows over Time with Scheduling Costs

DOI10.1007/978-3-030-45771-6_11zbMath1504.90014arXiv1912.00082OpenAlexW3017322911MaRDI QIDQ5041740

Neil Olver, Dario Frascaria

Publication date: 14 October 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.00082

zbMATH Keywords

trafficflows over timetolls

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Games involving graphs (91A43) Stochastic network models in operations research (90B15) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Cites Work

• Unnamed Item
• Unnamed Item
• Nash equilibria and the price of anarchy for flows over time
• Transient flows in networks
• 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
• On the Price of Anarchy for Flows over Time
• Nash Flows Over Time with Spillback
• Constructing Maximal Dynamic Flows from Static Flows
• Combinatorial optimization with rational objective functions
• Algorithmic Game Theory
• Infinite Horizon Programs
• An Algorithm for Universal Maximal Dynamic Flows in a Network

This page was built for publication: Algorithms for Flows over Time with Scheduling Costs