A b<scp>ranch‐and‐cut</scp> approach and alternative formulations for the traveling salesman problem with drone

DOI10.1002/net.21958MaRDI QIDQ6092656

Mahdi Moeini, Oliver Wendt, Daniel Schermer

Publication date: 23 November 2023

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

traveling salesman problemmixed integer linear programmingbranch-and-cutlogisticsdroneslast-mile delivery

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (1)

Trucks and drones cooperation in the last‐mile delivery process

Cites Work

• Benders decomposition without separability: a computational study for capacitated facility location problems
• The vehicle routing problem with drones: several worst-case results
• A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem
• A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations
• Integer Programming Formulation of Traveling Salesman Problems
• The vehicle routing problem with drones: Extended models and connections
• A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
• A variable neighborhood search for flying sidekick traveling salesman problem

This page was built for publication: A b<scp>ranch‐and‐cut</scp> approach and alternative formulations for the traveling salesman problem with drone