A new MILP formulation for the flying sidekick traveling salesman problem

DOI10.1002/net.22172zbMath1529.90062OpenAlexW4383264439MaRDI QIDQ6139381

Maurizio Boccia, A. Mancuso, Claudio Sterle, Adriano Masone

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22172

zbMATH Keywords

branch-and-cutMILPdronesFS-TSP

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Cites Work

• Orienteering problem: a survey of recent variants, solution approaches and applications
• Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm
• Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem
• Multi-visit drone routing problem
• A branch-and-cut algorithm for the median-path problem
• A new approach to the minimum cut problem
• A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
• A tabu search method for the truck and trailer routing problem
• Unmanned aerial vehicles/drones in vehicle routing problems: a literature review
• A variable neighborhood search for flying sidekick traveling salesman problem

This page was built for publication: A new MILP formulation for the flying sidekick traveling salesman problem