Issues in the implementation of the DSD algorithm for the traffic assignment problem-Reference-Cited by-同舟云学术

Issues in the implementation of the DSD algorithm for the traffic assignment problem

Published:2006-12 Issue:3 Volume:175 Page:1577-1587
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Lotito Pablo A.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference15 articles.

1. Modeling dynamic transportation networks: An intelligent transportation system oriented approach;Boyce,1996

2. An O(n) algorithm for quadratic knapsack problems;Brucker;Operations Research Letters,1984

3. Computational study of state-of-the-art path-based traffic assignment algorithms;Chen;Mathematics and Computers in Simulation,2002

4. G. Cohen, Convexité et optimisation, École Nationale des Ponts et Chaussées, 2000, Available from: .

5. Distributed disaggregated simplicial decomposition—a parallel algorithm for traffic assignment;Damberg,1997

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the paper “Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem”;European Journal of Operational Research;2024-03

2. Traffic sensor location using Wardrop equilibrium;Computational and Applied Mathematics;2023-08-22

3. Parallelization of the B static traffic assignment algorithm;Ain Shams Engineering Journal;2022-03

4. A finite element approach for the traffic assignment problem;Transportation Research Procedia;2021

5. A decomposition scheme for parallelization of system optimal dynamic traffic assignment on urban networks with multiple origins and destinations;Computer-Aided Civil and Infrastructure Engineering;2019-05-29