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 the normal view instead:
scientific article; zbMATH DE number 6113024
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7810842990875244
0 references
0.7201274037361145
0 references
0.6961254477500916
0 references
0.6934066414833069
0 references
0.6917440295219421
0 references
