Bicriterion path problems in directed graphs are systematically studied. A series of ten problems are defined and their computational complexity examined. Algorithms are provided for some of them, including polynomial algorithms for the MAXMIN-MAXMIN problem and the MINSUM-MAXMIN problem, and a pseudo-polynomial exact algorithm as well as a fully polynomial approximation scheme for the MINSUM-MINSUM problem.
CITATION STYLE
Hansen, P. (1980). Bicriterion Path Problems (pp. 109–127). https://doi.org/10.1007/978-3-642-48782-8_9
Mendeley helps you to discover research relevant for your work.