On computational complexity of the constructive-optimizer neural network for the traveling salesman problem
Sign Up to like & getrecommendations! Published in 2018 at "Neurocomputing"
DOI: 10.1016/j.neucom.2018.09.039
Abstract: Abstract The authors formerly proposed the constructive-optimizer neural network (CONN) for the traveling salesman problem (TSP) to provide the best compromise between the solution quality and convergence speed. However, the computational complexity of CONN were… read more here.
Keywords: constructive optimizer; conn; optimizer neural; neural network ... See more keywords