Optimal Flows in Stochastic Dynamic Networks with Congestion

DOI10.1287/opre.41.1.203zbMath0771.90044OpenAlexW2169634727MaRDI QIDQ5288152

James K. Ho, John R. Birge

Publication date: 9 August 1993

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

Full work available at URL: https://doi.org/10.1287/opre.41.1.203

zbMATH Keywords

dynamic traffic assignmentdynamic networkdecomposition algorithmrandom inputsoptimal flowsjob shop routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (7)

Intelligent transportation systems -- Enabling technologies ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem ⋮ Linear programming models for the user and system optimal dynamic network design problem: Formulations, comparisons and extensions ⋮ The analysis of Braess' paradox and robustness based on dynamic traffic assignment models ⋮ Modelling and analysis of multistage stochastic programming problems: A software environment ⋮ Dynamic traffic network model and time-dependent Braess' paradox

Uses Software

• MSLiP

This page was built for publication: Optimal Flows in Stochastic Dynamic Networks with Congestion