Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078)
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 6107535
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the double traveling salesman problem with multiple stacks |
scientific article; zbMATH DE number 6107535 |
Statements
Efficient algorithms for the double traveling salesman problem with multiple stacks (English)
0 references
15 November 2012
0 references
traveling salesman problem
0 references
LIFO constraints
0 references
efficient algorithms
0 references
heuristics
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8509801626205444
0 references
0.8465093970298767
0 references
0.8372141122817993
0 references
0.833840012550354
0 references
0.8313397169113159
0 references
