The multiobjective shortest path problem is NP-hard, or is it?
From MaRDI portal
Publication:5215915
Recommendations
- scientific article; zbMATH DE number 4070651
- Hard to say it's easy -- four reasons why combinatorial multiobjective programmes are hard
- 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)