Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/corr/abs-1908-07060
%A Binh, Huynh Thi Thanh
%A Thanh, Pham Dinh
%A Thang, Ta Bao
%D 2019
%J CoRR
%K dblp
%T New Approach for Solving The Clustered Shortest-Path Tree Problem Based on Reducing The Search Space of Evolutionary Algorithm.
%U http://dblp.uni-trier.de/db/journals/corr/corr1908.html#abs-1908-07060
%V abs/1908.07060
@article{journals/corr/abs-1908-07060,
added-at = {2019-08-26T00:00:00.000+0200},
author = {Binh, Huynh Thi Thanh and Thanh, Pham Dinh and Thang, Ta Bao},
biburl = {https://www.bibsonomy.org/bibtex/2dfee1a5bda1181b5ee0a20d8eb6d594f/dblp},
ee = {http://arxiv.org/abs/1908.07060},
interhash = {88f006824b341b2b49f50e8d27f03fcc},
intrahash = {dfee1a5bda1181b5ee0a20d8eb6d594f},
journal = {CoRR},
keywords = {dblp},
timestamp = {2019-08-27T11:37:16.000+0200},
title = {New Approach for Solving The Clustered Shortest-Path Tree Problem Based on Reducing The Search Space of Evolutionary Algorithm.},
url = {http://dblp.uni-trier.de/db/journals/corr/corr1908.html#abs-1908-07060},
volume = {abs/1908.07060},
year = 2019
}