New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2968488)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks |
scientific article |
Statements
New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (English)
0 references
16 March 2017
0 references
integer programming
0 references
transportation
0 references
traveling salesman
0 references
valid inequalities
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
