On a multicriteria shortest path problem

Citations

Cited by:

1. Lee, Chungmok & Han, Jinil, 2017. "Benders-and-Price approach for electric vehicle charging station location problem under probabilistic travel range," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 130-152.
2. Soroush, H.M., 2008. "Optimal paths in bi-attribute networks with fractional cost functions," European Journal of Operational Research, Elsevier, vol. 190(3), pages 633-658, November.
3. Dell'Olmo, Paolo & Gentili, Monica & Scozzari, Andrea, 2005. "On finding dissimilar Pareto-optimal paths," European Journal of Operational Research, Elsevier, vol. 162(1), pages 70-82, April.
4. Iori, Manuel & Martello, Silvano & Pretolani, Daniele, 2010. "An aggregate label setting policy for the multi-objective shortest path problem," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1489-1496, December.
5. Xue, Li & Luo, Zhixing & Lim, Andrew, 2015. "Two exact algorithms for the traveling umpire problem," European Journal of Operational Research, Elsevier, vol. 243(3), pages 932-943.
6. Isada, Yuriko & James, Ross J. W. & Nakagawa, Yuji, 2005. "An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint," European Journal of Operational Research, Elsevier, vol. 162(2), pages 503-513, April.
7. Lee, Chungmok, 2022. "A robust optimization approach with probe-able uncertainty," European Journal of Operational Research, Elsevier, vol. 296(1), pages 218-239.
8. Pulido, Francisco Javier & Mandow, Lawrence & Pérez de la Cruz, José Luis, 2014. "Multiobjective shortest path problems with lexicographic goal-based preferences," European Journal of Operational Research, Elsevier, vol. 239(1), pages 89-101.
9. Caramia, M. & Guerriero, F., 2009. "A heuristic approach to long-haul freight transportation with multiple objective functions," Omega, Elsevier, vol. 37(3), pages 600-614, June.
10. Sedeño-noda, Antonio & Colebrook, Marcos, 2019. "A biobjective Dijkstra algorithm," European Journal of Operational Research, Elsevier, vol. 276(1), pages 106-118.
11. Granat, Janusz & Guerriero, Francesca, 2003. "The interactive analysis of the multicriteria shortest path problem by the reference point method," European Journal of Operational Research, Elsevier, vol. 151(1), pages 103-118, November.
12. Nachtigall, K., 1995. "Time depending shortest-path problems with applications to railway networks," European Journal of Operational Research, Elsevier, vol. 83(1), pages 154-166, May.
13. Wang, Li & Yang, Lixing & Gao, Ziyou, 2016. "The constrained shortest path problem with stochastic correlated link travel times," European Journal of Operational Research, Elsevier, vol. 255(1), pages 43-57.
14. Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
15. Duque, Daniel & Lozano, Leonardo & Medaglia, Andrés L., 2015. "An exact method for the biobjective shortest path problem for large-scale road networks," European Journal of Operational Research, Elsevier, vol. 242(3), pages 788-797.
16. Opasanon, Sathaporn & Miller-Hooks, Elise, 2006. "Multicriteria adaptive paths in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 173(1), pages 72-91, August.
17. Ehrgott, Matthias & Ide, Jonas & Schöbel, Anita, 2014. "Minmax robustness for multi-objective optimization problems," European Journal of Operational Research, Elsevier, vol. 239(1), pages 17-31.
18. Galand, Lucie & Perny, Patrice & Spanjaard, Olivier, 2010. "Choquet-based optimisation in multiobjective shortest path and spanning tree problems," European Journal of Operational Research, Elsevier, vol. 204(2), pages 303-315, July.
19. Ehrgott, Matthias & Klamroth, Kathrin, 1997. "Connectedness of efficient solutions in multiple criteria combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 97(1), pages 159-166, February.
20. Groß, Patrick-Oliver & Ehmke, Jan Fabian & Mattfeld, Dirk Christian, 2020. "Interval travel times for robust synchronization in city logistics vehicle routing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
21. Gabrel, Virginie & Vanderpooten, Daniel, 2002. "Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite," European Journal of Operational Research, Elsevier, vol. 139(3), pages 533-542, June.
22. Shi, Ning & Zhou, Shaorui & Wang, Fan & Tao, Yi & Liu, Liming, 2017. "The multi-criteria constrained shortest path problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 13-29.
23. Modesti, Paola & Sciomachen, Anna, 1998. "A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks," European Journal of Operational Research, Elsevier, vol. 111(3), pages 495-508, December.
24. Safer, Hershel M. & Orlin, James B., 1953-, 1995. "Fast approximation schemes for multi-criteria combinatorial optimization," Working papers 3756-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
25. Perny, Patrice & Spanjaard, Olivier, 2005. "A preference-based approach to spanning trees and shortest paths problems***," European Journal of Operational Research, Elsevier, vol. 162(3), pages 584-601, May.
26. de Lima Pinto, Leizer & Bornstein, Cláudio Thomás & Maculan, Nelson, 2009. "The tricriterion shortest path problem with at least two bottleneck objective functions," European Journal of Operational Research, Elsevier, vol. 198(2), pages 387-391, October.