An evolutionary approach for finding optimal trees in undirected networks

DOI10.1016/S0377-2217(98)00385-3zbMath0985.90016OpenAlexW2032264127MaRDI QIDQ1579498

David K. Smith, Godfrey A. Walters

Publication date: 14 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00385-3

zbMATH Keywords

optimizationnetworksgenetic algorithmswatergas

Mathematics Subject Classification ID

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

Related Items (1)

Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure

Uses Software

• Genocop

Cites Work

• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An evolutionary approach for finding optimal trees in undirected networks