Length-constrained cycle partition with an application to UAV routing*

DOI10.1080/10556788.2022.2053972OpenAlexW3118862855MaRDI QIDQ5058406

Oleg P. Burdakov, Thorsten Koch, Gioni Mexi, Carl Johan Casselgren, Kai Hoppmann-Baum

Publication date: 20 December 2022

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2022.2053972

zbMATH Keywords

combinatorial optimizationmixed integer programmingtravelling salesperson problemuncrewed aerial vehicles

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Uses Software

• TSPLIB
• Gurobi
• PESPLib

Cites Work

• Unnamed Item
• PESPLib
• A note on the problem of reporting maximal cliques
• Minimum cycle partition with length requirements
• Cyclic-routing of unmanned aerial vehicles
• The Truck Dispatching Problem
• Cyclic Routing of Unmanned Aerial Vehicles
• The Cyclic-Routing UAV Problem is PSPACE-Complete
• Integer Programming Formulation of Traveling Salesman Problems
• A quick method for finding shortest pairs of disjoint paths
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• A Mathematical Model for Periodic Scheduling Problems
• TSPLIB—A Traveling Salesman Problem Library
• P-Complete Approximation Problems
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• Solution of a Large-Scale Traveling-Salesman Problem
• New approximation algorithms for the minimum cycle cover problem