An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem (Q6142940)
From MaRDI portal
scientific article; zbMATH DE number 7793380
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem |
scientific article; zbMATH DE number 7793380 |
Statements
An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem (English)
0 references
23 January 2024
0 references
parallel drone scheduling
0 references
traveling salesman problem
0 references
branch-and-cut
0 references
benchmark instances
0 references
