Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multitask n-vehicle exploration problem: complexity and algorithm |
scientific article; zbMATH DE number 6250623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multitask \(n\)-vehicle exploration problem: complexity and algorithm |
scientific article; zbMATH DE number 6250623 |
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
0.8278648257255554
0 references
0.7955443263053894
0 references
0.782522439956665
0 references
0.7810842990875244
0 references
0.7660936117172241
0 references
