Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks |
scientific article |
Statements
Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (English)
0 references
11 March 2022
0 references
combinatorial optimization
0 references
branch-and-cut
0 references
traveling salesman
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
0 references
0 references
0 references
