An exact method for the biobjective shortest path problem for large-scale road networks-Reference-Cited by-同舟云学术

An exact method for the biobjective shortest path problem for large-scale road networks

Published:2015-05 Issue:3 Volume:242 Page:788-797
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Duque Daniel,Lozano Leonardo,Medaglia Andrés L.

Publisher

Elsevier BV

Subject

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

Reference38 articles.

1. Route planning in transportation networks;Bast,2014

2. An algorithm for the resource constrained shortest path problem;Beasley;Networks,1989

3. Network optimization: Continuous and discrete models;Bertsekas,1998

4. Solving real-world linear programs: A decade and more of progress;Bixby;Operations Research,2002

5. Acceleration strategies for the weight constrained shortest path problem with replenishment;Bolívar;Optimization Letters,2014

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

1. Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends;Algorithms;2024-05-22

2. Maximizing the Thermal Comfort of Pedestrians with UAV Imagery and Multiobjective Spatial Optimization;UAVs for Spatial Modelling and Urban Informatics;2024

3. Solving the park-and-loop routing problem by branch-price-and-cut;Transportation Research Part C: Emerging Technologies;2023-12

4. A multiphase dynamic programming algorithm for the shortest path problem with resource constraints;European Journal of Operational Research;2023-12

5. Optimization problems with evidential linear objective;International Journal of Approximate Reasoning;2023-10