Evolutionary design of oriented-tree networks using Cayley-type encodings

DOI10.1016/j.ins.2009.06.034zbMath1180.90036OpenAlexW2134975671MaRDI QIDQ730939

Sancho Salcedo-Sanz, Maurizio Naldi, Emilio G. Ortiz-García, Ángel M. Pérez-Bellido, Antonio Portilla-Figueras

Publication date: 1 October 2009

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2108/33857

zbMATH Keywords

evolutionary algorithmsDandelion codeoriented-tree network design problemPrüfer encodingtree encodings

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (2)

Path lengths in tree-child time consistent hybridization networks ⋮ Stochastic comparisons for rooted butterfly networks and tree networks, with random environments

Cites Work

• Unnamed Item
• Clustering algorithms for scenario tree generation: application to natural hydro inflows
• On embedding subclasses of height-balanced trees in hypercubes
• Algorithms for path medi-centers of a tree
• An efficient network-wide broadcasting based on hop-limited shortest-path trees
• A new genetic approach to construct near-optimal binary search trees
• The multi-criteria minimum spanning tree problem based genetic algorithm
• Local solutions for global problems in wireless networks
• Models of adding relations to an organization structure of a complete \(K\)-ary tree
• Bucket brigades on in-tree assembly networks
• A Bijective Code for k-Trees with Linear Time Encoding and Decoding
• Spanning Trees and Optimization Problems

This page was built for publication: Evolutionary design of oriented-tree networks using Cayley-type encodings