Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6250623 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
multitask \(n\)-vehicle exploration problem (MTNVEP) | |||
| Property / zbMATH Keywords: multitask \(n\)-vehicle exploration problem (MTNVEP) / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
NP-hard | |||
| Property / zbMATH Keywords: NP-hard / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
strongly NP-hard | |||
| Property / zbMATH Keywords: strongly NP-hard / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
heuristic algorithm | |||
| Property / zbMATH Keywords: heuristic algorithm / rank | |||
Normal rank | |||
Revision as of 14:54, 29 June 2023
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
