The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697)
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 team orienteering problem with time windows: an LP-based granular variable neighborhood search |
scientific article; zbMATH DE number 6119332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The team orienteering problem with time windows: an LP-based granular variable neighborhood search |
scientific article; zbMATH DE number 6119332 |
Statements
The team orienteering problem with time windows: an LP-based granular variable neighborhood search (English)
0 references
29 December 2012
0 references
team orienteering problem
0 references
time windows
0 references
variable neighborhood search
0 references
LP-based granularity
0 references
0 references
0.8228729963302612
0 references
0.8183763027191162
0 references
0.8174710869789124
0 references
0.8165107369422913
0 references
0.8145706057548523
0 references
