Pulido, Francisco Javier; Mandow, Lawrence; Cruz, … - In: European Journal of Operational Research 239 (2014) 1, pp. 89-101
Multiobjective shortest path problems are computationally harder than single objective ones. In particular, execution time is an important limiting factor in exact multiobjective search algorithms. This paper explores the possibility of improving search performance in those cases where the...