Computation of Dynamic Equilibria in Series-Parallel Networks

DOI10.1287/moor.2020.1108zbMath1491.90026arXiv2002.11428OpenAlexW3202852540MaRDI QIDQ5076691

Marcus Kaiser

Publication date: 17 May 2022

Published in: Mathematics of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

series-parallelflow over timedynamic equilibriumfluid queuing model

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nash equilibria and the price of anarchy for flows over time
• On the complexity of the parity argument and other inefficient proofs of existence
• Long term behavior of dynamic equilibria in fluid queuing networks
• A Stackelberg strategy for routing flow over time
• On the Existence of Solutions to the Dynamic User Equilibrium Problem
• An Introduction to Network Flows over Time
• Existence and Uniqueness of Equilibria for Flows over Time
• Dynamic Equilibria in Fluid Queueing Networks
• The Linear Complementarity Problem
• Graph Classes: A Survey
• Nash Flows Over Time with Spillback
• Dynamic flows with adaptive route choice

This page was built for publication: Computation of Dynamic Equilibria in Series-Parallel Networks