Decremental state-space relaxations for the basic traveling salesman problem with a drone

DOI10.1287/IJOC.2022.0390MaRDI QIDQ6598944zbMATH OpenFDO

Authors Marcos Blufstein, Gonzalo Lera-Romero, Francisco J. Soulignac

Publication date 5 September 2024

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/IJOC.2022.0390

zbMATH Keywords

dynamic programmingcolumn generationvariable fixingcompletion boundsdecremental state-space relaxationtraveling salesman problem with a drone

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cited in

(3)

• Truck-drone pickup and delivery service optimization with availability profiles
• A MILP and a genetic algorithm for the flying sidekick TSP with variable drone speeds
• A new formulation for the traveling salesman problem with drone and lockers

This page was built for publication: Decremental state-space relaxations for the basic traveling salesman problem with a drone

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6598944)