Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11424-012-9324-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989000650 / rank | |||
Normal rank | |||
Revision as of 22:41, 19 March 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
