scientific article; zbMATH DE number 1472129

MaRDI QIDQ4489181zbMATH OpenFDO

Authors William Edelson, Michael L. Gargano

Publication date 9 July 2000

zbMATH Keywords

genetic algorithmminimal spanning tree problemPrüfer code

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Minimal edge-ordered spanning trees using a self-adapting genetic algorithm with multiple genomic representations
• Constrained minimal spanning trees solved by a GA with feasible encodings
• A solution of real-world OCST problems with a new tree encoding-based genetic algorithm
• scientific article; zbMATH DE number 1990670
• An effective implementation of a direct spanning tree representation in GAs

Cited in

(8)

• Constrained minimal spanning trees solved by a GA with feasible encodings
• An effective implementation of a direct spanning tree representation in GAs
• Minimal edge-ordered spanning trees using a self-adapting genetic algorithm with multiple genomic representations
• scientific article; zbMATH DE number 1990670 (Why is no real title available?)
• scientific article; zbMATH DE number 1743819 (Why is no real title available?)
• Making the edge-set encoding fly by controlling the bias of its crossover operator
• An adaptive genetic algorithm for the minimal switching graph problem
• Evolutionary design of oriented-tree networks using Cayley-type encodings

This page was built for publication:

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