Non-additive shortest path in the context of traffic assignment
Year of publication: |
1 July 2018
|
---|---|
Authors: | Perederieieva, Olga ; Raith, Andrea ; Schmidt, Marie |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 268.2018, 1 (1.7.), p. 325-338
|
Subject: | Non-additive shortest path | Traffic assignment | Empirical study | Flow update | Theorie | Theory | Verkehrsweg | Transport route | Verkehrsplanung | Transport planning |
-
A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
Ryu, Seungkyu, (2014)
-
A framework for and empirical study of algorithms for traffic assignment
Perederieieva, Olga, (2015)
-
Hyperbush algorithm for strategy-based equilibrium traffic assignment problems
Xu, Zhandong, (2022)
- More ...
-
A framework for and empirical study of algorithms for traffic assignment
Perederieieva, Olga, (2015)
-
Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
Raith, Andrea, (2018)
-
Ehrgott, Matthias, (2019)
- More ...