Solving a class of network models for dynamic flow control

DOI10.1016/0377-2217(94)90191-0zbMath0809.90042OpenAlexW2056635626MaRDI QIDQ1333519

Ashok Srinivasan, Malachy Carey

Publication date: 15 September 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90191-0

zbMATH Keywords

transportationtraffic flowsmulti-period network modelstore-and-forward network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (1)

Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum

Uses Software

• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of dynamic network flows
• An efficient implementation of the network simplex method
• An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
• Validation of subgradient optimization
• Modeling and optimal control of congested transportation systems
• Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems

This page was built for publication: Solving a class of network models for dynamic flow control