The Multiobjective Shortest Path Problem Is NP-Hard, or Is It? (Q5215915)
From MaRDI portal
scientific article; zbMATH DE number 7167189
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Multiobjective Shortest Path Problem Is NP-Hard, or Is It? |
scientific article; zbMATH DE number 7167189 |
Statements
The Multiobjective Shortest Path Problem Is NP-Hard, or Is It? (English)
0 references
13 February 2020
0 references
