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

DOI10.1002/(SICI)1097-0037(199709)30:2%3C91::AID-NET3%3E3.0.CO;2-FMaRDI QIDQ4361179zbMATH OpenOpenAlexFDO

Authors Gengui Zhou, Mitsuo Gen

Publication date 26 October 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199709)30:2%3C91::aid-net3%3E3.0.co;2-f

zbMATH Keywords

degree-constrained spanning tree problemgenetic algorithmsNP-hard complexity

Mathematics Subject Classification ID

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

Recommendations

• Comparison of algorithms for the degree constrained minimum spanning tree
• New genetic algorithm approach for the MIN-degree constrained minimum spanning tree
• scientific article; zbMATH DE number 1054929
• Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems
• A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks

Cited in

(20)

• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem
• New genetic algorithm approach for the MIN-degree constrained minimum spanning tree
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems
• On coding labeled trees
• Using Lagrangian dual information to generate degree constrained spanning trees
• Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
• Constrained minimal spanning trees solved by a GA with feasible encodings
• scientific article; zbMATH DE number 1617347 (Why is no real title available?)
• scientific article; zbMATH DE number 1703847 (Why is no real title available?)
• Algorithms for degree-constrained Euclidean Steiner minimal tree
• A genetic algorithm approach on tree-like telecommunication network design problem
• A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
• scientific article; zbMATH DE number 1054929 (Why is no real title available?)
• An approach to a problem in network design using genetic algorithms
• scientific article; zbMATH DE number 2214470 (Why is no real title available?)
• Globally and locally minimal weight spanning tree networks
• Comparison of algorithms for the degree constrained minimum spanning tree
• An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem

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

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