The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (Q1025245)
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 double traveling salesman problem with multiple stacks: A variable neighborhood search approach |
scientific article; zbMATH DE number 5566390
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The double traveling salesman problem with multiple stacks: A variable neighborhood search approach |
scientific article; zbMATH DE number 5566390 |
Statements
The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (English)
0 references
18 June 2009
0 references
traveling salesman problem
0 references
variable neighborhood search
0 references
LIFO loading
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9509436
0 references
0.94340616
0 references
0.93847746
0 references
0.93397254
0 references
0.92781484
0 references
0.92101765
0 references
0.92061234
0 references
0.91863555
0 references
0.9128487
0 references
