Time-Expanded Graphs for Flow-Dependent Transit Times
- 29 August 2002
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 599-611
- https://doi.org/10.1007/3-540-45749-6_53
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The Quickest Multicommodity Flow ProblemLecture Notes in Computer Science, 2002
- An approach to modelling time-varying flows on congested networksTransportation Research Part B: Methodological, 2000
- Efficient continuous-time dynamic network flow algorithmsOperations Research Letters, 1998
- System Optimal Dynamic Assignment for Electronic Route Guidance in a Congested Traffic NetworkPublished by Springer Science and Business Media LLC ,1995
- The quickest flow problemMathematical Methods of Operations Research, 1993
- A survey of dynamic network flowsAnnals of Operations Research, 1989
- Optimal Time-Varying Flows on Congested NetworksOperations Research, 1987
- A Constraint Qualification for a Dynamic Traffic Assignment ModelTransportation Science, 1986
- A Model and an Algorithm for the Dynamic Traffic Assignment ProblemsTransportation Science, 1978
- Constructing Maximal Dynamic Flows from Static FlowsOperations Research, 1958