Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
- 期刊名称Annals of Mathematics and Artificial Intelligence
- 作者Khachay, Michael; Neznakhina, Katherine
- 印刷ISSN1012-2443
- 电子ISSN1573-7470
- 文件大小1238.09KB
- 发表时间2019-3-28
- DOI10.1007/s10472-019-09626-w
Interval-valued fuzzy line graphsAkram, Muhammad · Neural Computing and Applications · 2012
Analyses forLp[a,Panahian Fard, Saeed; Zainuddin, Zarita · Neural Computing and Applications · 2014
Binary bat algorithmMirjalili, Seyedali; Mirjalili, Seyed Mohammad; Yang, Xin-She · Neural Computing and Applications · 2014
Local coupled extreme learning machineQu, Yanpeng · Neural Computing and Applications · 2016
Wavelet twin support vector machineDing, Shifei; Wu, Fulin; Shi, Zhongzhi · Neural Computing and Applications · 2014
Artificial neural network for steganographyHusien, Sabah; Badi, Haitham · Neural Computing and Applications · 2015
Invasive weed classificationRazavi-Far, Roozbeh; Palade, Vasile; Zio, Enrico · Neural Computing and Applications · 2015
Monarch butterfly optimizationWang, Gai-Ge; Deb, Suash; Cui, Zhihua · Neural Computing and Applications · 2015