Minimum cycle partition with length requirements

DOI10.1007/978-3-030-58942-4_18OpenAlexW3090976626MaRDI QIDQ2110416

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

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-58942-4_18

zbMATH Keywords

combinatorial optimizationtravelling salesman problemmixed integer linear programmingunmanned aerial vehiclesconflict graph

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)

Related Items

An overview of graph covering and partitioning ⋮ Length-constrained cycle partition with an application to UAV routing*

Uses Software

• TSPLIB
• Gurobi

This page was built for publication: Minimum cycle partition with length requirements