Lawrence Mandow

Learn More
The article describes and analyzes NAMOA<sup>*</sup>, an algorithm for multiobjective heuristic graph search problems. The algorithm is presented as an extension of A<sup>*</sup>, an admissible scalar shortest path algorithm. Under consistent heuristics A<sup>*</sup> is known to improve its efficiency with more informed heuristics, and to be optimal over(More)
We present a parallel algorithm for finding all Pareto optimal paths from a specified source in a graph. The algorithm is label-setting, i.e., it only performs work on distance labels that are optimal. The main result is that the added complexity when going from one to multiple objectives is completely parallelizable. The algorithm is based on a(More)