Minimum cycle partition with length requirements

DOI10.1007/978-3-030-58942-4_18MaRDI QIDQ2110416zbMATH OpenOpenAlexFDO

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

Publication date 21 December 2022

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

zbMATH Keywords

combinatorial optimizationconflict graphmixed integer linear programmingtravelling salesman problemunmanned aerial vehicles

Mathematics Subject Classification ID

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

Recommendations

• Minimum degree conditions for monochromatic cycle partitioning
• scientific article; zbMATH DE number 637536
• On a cycle partition problem
• On the shortest separating cycle
• Partitioning graphs into paths or cycles of prescribed lengths
• The shortest separating cycle problem
• Longest minimal length partitions
• Cycle Partitions in Graphs
• Cycle lengths and minimum degree of graphs
• scientific article; zbMATH DE number 1792660

Cited in

(3)

• An overview of graph covering and partitioning
• scientific article; zbMATH DE number 6692113 (Why is no real title available?)
• Length-constrained cycle partition with an application to UAV routing*

Describes a project that uses

Uses Software

• Gurobi
• TSPLIB

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

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