Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks (Q1652571)
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: Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks |
scientific article; zbMATH DE number 6901564
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks |
scientific article; zbMATH DE number 6901564 |
Statements
Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks (English)
0 references
11 July 2018
0 references
traveling salesman
0 references
loading constraints
0 references
branch-and-cut
0 references
pickup and delivery
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
