The multiobjective shortest path problem is NP-hard, or is it?

DOI10.1007/978-3-319-54157-0_6MaRDI QIDQ5215915zbMATH OpenOpenAlexFDO

Authors Fritz Bökler

Publication date 13 February 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-54157-0_6

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29)

Recommendations

• scientific article; zbMATH DE number 4070651
• scientific article; zbMATH DE number 1530340
• Approximability and Hardness in Multi-objective Optimization
• scientific article; zbMATH DE number 26845
• \(NP\)-hardness of linear multiplicative programming and related problems

Cited in

(5)

• Bi-criteria path problem with minimum length and maximum survival probability
• Structural complexity of multiobjective NP search problems
• scientific article; zbMATH DE number 4070651 (Why is no real title available?)
• scientific article; zbMATH DE number 1558116 (Why is no real title available?)
• On the computational complexity of ordinal multi-objective unconstrained combinatorial optimization

This page was built for publication: The multiobjective shortest path problem is NP-hard, or is it?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215915)