An Intelligent and Flexible Solution for the Balanced Spanning Tree Problem
Created by W.Langdon from
gp-bibliography.bib Revision:1.8098
- @InProceedings{Tahan:2019:ICSPIS,
-
author = "Marzieh Hajizadeh Tahan and Mohammad Ghasemzadeh",
-
booktitle = "2019 5th Iranian Conference on Signal Processing and
Intelligent Systems (ICSPIS)",
-
title = "An Intelligent and Flexible Solution for the Balanced
Spanning Tree Problem",
-
year = "2019",
-
abstract = "Construction of Balanced Spanning Tree is one of the
problems in computer science with many applications
such as in communications and social networks. A
balanced spanning tree is obtained through a trade-off
between finding the minimum spanning tree and the
shortest path tree in a graph. Already some methods are
presented for this problem; in this research work, we
discuss the advantages and shortcomings of each one and
then we present a new flexible intelligent method which
is based on multiobjective genetic programming.",
-
keywords = "genetic algorithms, genetic programming",
-
DOI = "doi:10.1109/ICSPIS48872.2019.9066030",
-
month = dec,
-
notes = "Also known as \cite{9066030}",
- }
Genetic Programming entries for
Marzieh Hajizadeh Tahan
Mohammad Ghasemzadeh
Citations