The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561)
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 tree representation for the pickup and delivery traveling salesman problem with LIFO loading |
scientific article; zbMATH DE number 6035022
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The tree representation for the pickup and delivery traveling salesman problem with LIFO loading |
scientific article; zbMATH DE number 6035022 |
Statements
The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (English)
0 references
14 May 2012
0 references
traveling salesman
0 references
pickup and delivery
0 references
last-in-first-out loading
0 references
tree data structure
0 references
variable neighborhood search
0 references
0 references
0 references
0 references
0 references
0.8621499538421631
0 references
0.837370753288269
0 references
0.806113064289093
0 references
0.7978400588035583
0 references
0.7934505343437195
0 references
