A genetic algorithm for minimum conflict weighted spanning tree problem

DOI10.1007/978-3-030-34960-8_39MaRDI QIDQ2216017zbMATH OpenOpenAlexFDO

Authors C. Cerrone, Andrea Di Placido, Davide Donato Russo

Publication date 15 December 2020

Full work available at URL https://doi.org/10.1007/978-3-030-34960-8_39

zbMATH Keywords

genetic algorithmconflict graphminimum conflict weighted spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The multi-criteria minimum spanning tree problem based genetic algorithm
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
• New genetic algorithm approach for the MIN-degree constrained minimum spanning tree
• A branch and cut algorithm for minimum spanning trees under conflict constraints

Cited in

(2)

• A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
• scientific article; zbMATH DE number 2214470 (Why is no real title available?)

This page was built for publication: A genetic algorithm for minimum conflict weighted spanning tree problem

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