Nash Flows Over Time with Spillback

DOI10.1137/1.9781611975482.57zbMath1431.90044arXiv1807.05862OpenAlexW2953052384MaRDI QIDQ5236241

Laura Vargas Koch, Leon Sering

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (10)

Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents ⋮ Algorithms for Flows over Time with Scheduling Costs ⋮ Computation of Dynamic Equilibria in Series-Parallel Networks ⋮ On the Price of Anarchy for Flows over Time ⋮ A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows ⋮ Dynamic flows with adaptive route choice ⋮ A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows ⋮ Bounding Residence Times for Atomic Dynamic Routings ⋮ Algorithms for flows over time with scheduling costs ⋮ Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks

This page was built for publication: Nash Flows Over Time with Spillback