A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit (Q692666)
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: A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit |
scientific article; zbMATH DE number 6113024
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit |
scientific article; zbMATH DE number 6113024 |
Statements
A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit (English)
0 references
6 December 2012
0 references
multi-task \(n\)-vehicle exploration problem
0 references
MTNVEP
0 references
maximizing average profit
0 references
fractional partition
0 references
NP-complete
0 references
strongly NP-complete
0 references
