The multiobjective shortest path problem is NP-hard, or is it? (Q5215915)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7167189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8007782101631165
0 references
0.7911480665206909
0 references
