The multi-district team orienteering problem (Q336760)
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: The multi-district team orienteering problem |
scientific article; zbMATH DE number 6650562
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The multi-district team orienteering problem |
scientific article; zbMATH DE number 6650562 |
Statements
The multi-district team orienteering problem (English)
0 references
10 November 2016
0 references
node routing
0 references
team orienteering problem
0 references
tasks scheduling
0 references
operations planning
0 references
adaptive large neighborhood search
0 references
0 references
0.7582658529281616
0 references
0.7388191819190979
0 references
0.735456645488739
0 references
0.7265368103981018
0 references
0.7230779528617859
0 references
