A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770)
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 6195665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks |
scientific article; zbMATH DE number 6195665 |
Statements
A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (English)
0 references
6 August 2013
0 references
traveling salesman
0 references
pickup
0 references
delivery
0 references
loading
0 references
multiple stacks
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9299830198287964
0 references
0.9111933708190918
0 references
0.9048191905021667
0 references
0.8894559741020203
0 references
