A note on genetic algorithms for degree-constrained spanning tree problems

DOI<91::AID-NET3>3.0.CO;2-F 10.1002/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-FzbMath0885.90114OpenAlexW1967977254MaRDI QIDQ4361179

Mitsuo Gen, Gengui Zhou

Publication date: 26 October 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199709)30:2<91::aid-net3>3.0.co;2-f

zbMATH Keywords

genetic algorithmsdegree-constrained spanning tree problemNP-hard complexity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (6)

Variable neighborhood search for the degree-constrained minimum spanning tree problem ⋮ On coding labeled trees ⋮ Using Lagrangian dual information to generate degree constrained spanning trees ⋮ Globally and locally minimal weight spanning tree networks ⋮ Genetic algorithm approach on multi-criteria minimum spanning tree problem ⋮ Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem

This page was built for publication: A note on genetic algorithms for degree-constrained spanning tree problems