A b<scp>ranch‐and‐cut</scp> approach and alternative formulations for the traveling salesman problem with drone (Q6092656): Difference between revisions
From MaRDI portal
Latest revision as of 13:53, 19 August 2024
scientific article; zbMATH DE number 7769715
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A b<scp>ranch‐and‐cut</scp> approach and alternative formulations for the traveling salesman problem with drone |
scientific article; zbMATH DE number 7769715 |
Statements
A b<scp>ranch‐and‐cut</scp> approach and alternative formulations for the traveling salesman problem with drone (English)
0 references
23 November 2023
0 references
branch-and-cut
0 references
drones
0 references
last-mile delivery
0 references
logistics
0 references
mixed integer linear programming
0 references
traveling salesman problem
0 references
0 references
0 references
0 references
