Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem.
Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann
VenueBCEC
Year2013
ProceedingsIEEE Congress on Evolutionary Computation
DBLP recordconf/cec/NallaperumaSN13a ↗
Browse the full CEC paper archive.