Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm
Crossref DOI link: https://doi.org/10.1007/s11227-016-1739-2
Published Online: 2016-05-24
Published Print: 2016-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Deb, Suash
Fong, Simon
Tian, Zhonghuan
Wong, Raymond K.
Mohammed, Sabah
Fiaidhi, Jinan
Funding for this research was provided by:
Universidade de Macau (MYRG2015-00128-FST)
Text and Data Mining valid from 2016-05-24