The Guilty net for the traveling salesman problem
From MaRDI portal
Publication:1200821
DOI10.1016/0305-0548(92)90047-9zbMath0757.90081OpenAlexW2005355041MaRDI QIDQ1200821
Laura I. Burke, Poulomi Damany
Publication date: 16 January 1993
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(92)90047-9
Programming involving graphs or networks (90C35) Neural networks for/in biological studies, artificial life and related topics (92B20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
The incorporation of an efficient initialization method and parameter adaptation using self-organizing maps to solve the TSP, Easing the conscience of the guilty net, Neural methods for the traveling salesman problem: Insights from operations research, Design rules for application specific dynamical systems, On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain, Self-organizing maps in evolutionary approach for the traveling salesman problem and vehicle routing problem with time windows, Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches, A Neural-Network-Based Approach to the Double Traveling Salesman Problem, An new self-organizing maps strategy for solving the traveling salesman problem, ``Conscientious neural nets for tour construction in the traveling salesman problem: The vigilant net, Kohonen maps for solving a class of location-allocation problems, Differential-algebraic approach to linear programming
Cites Work
- ``Neural computation of decisions in optimization problems
- Self-organization and associative memory.
- Spacefilling curves and the planar travelling salesman problem
- A study on neural networks
- The Bottleneck Traveling Salesman Problem
- Neural networks and physical systems with emergent collective computational abilities.
