Abstract
The paper develops vector frontier search, a new multiobjective search strategy that achieves an important reduction in space requirements over previous proposals. The complexity of a resulting multiobjective frontier search algorithm is analyzed and its performance is evaluated over a set of random problems. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Mandow, L., & De La Cruz, J. L. P. (2009). A memory-efficient search strategy for multiobjective shortest path problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5803 LNAI, pp. 25–32). https://doi.org/10.1007/978-3-642-04617-9_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
