The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888)
From MaRDI portal
scientific article; zbMATH DE number 7776620
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods |
scientific article; zbMATH DE number 7776620 |
Statements
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (English)
0 references
12 December 2023
0 references
branch-\&-cut algorithm
0 references
clustered vehicle routing
0 references
family traveling salesman problem
0 references
multi-depot routing problems
0 references
valid inequalities
0 references
warehouse management
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
