Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:22, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multitask \(n\)-vehicle exploration problem: complexity and algorithm |
scientific article |
Statements
Multitask \(n\)-vehicle exploration problem: complexity and algorithm (English)
0 references
27 January 2014
0 references
multitask \(n\)-vehicle exploration problem (MTNVEP)
0 references
NP-hard
0 references
strongly NP-hard
0 references
heuristic algorithm
0 references
