Simple heuristics for the rooted max tree coverage problem

DOI10.1007/978-3-031-49611-0_18MaRDI QIDQ6606188zbMATH OpenFDO

Authors Jiang Zhou, Peng Zhang

Publication date 16 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49611-0_18

zbMATH Keywords

\(k\)-MSTCMSAcombinatorial optimizationmax tree coveragemeta-heuristic

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
• Finding happiness: an analysis of the maximum happy vertices problem
• scientific article; zbMATH DE number 1195632 (Why is no real title available?)
• scientific article; zbMATH DE number 1256763 (Why is no real title available?)
• scientific article; zbMATH DE number 1445374 (Why is no real title available?)
• scientific article; zbMATH DE number 1445375 (Why is no real title available?)
• Improved algorithms for orienteering and related problems
• New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
• Spanning Trees—Short or Small

Cited in

(1)

• CMSA based on set covering models for packing and routing problems

This page was built for publication: Simple heuristics for the rooted max tree coverage problem

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