Exact solutions to the double travelling salesman problem with multiple stacks (Q3064039)
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 5827897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact solutions to the double travelling salesman problem with multiple stacks |
scientific article; zbMATH DE number 5827897 |
Statements
Exact solutions to the double travelling salesman problem with multiple stacks (English)
0 references
20 December 2010
0 references
traveling salesman problem
0 references
pickup and delivery
0 references
loading
0 references
LIFO
0 references
branch and cut
0 references
0 references
0 references
0.9219974875450134
0 references
0.9134960174560548
0 references
0.9017504453659058
0 references
0.8886140584945679
0 references
