Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s11424-012-9324-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11424-012-9324-0 / rank | |||
Normal rank | |||
Latest revision as of 16:15, 9 December 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
0 references
0 references
