Pages that link to "Item:Q2563885"

The following pages link to ``Conscientious'' neural nets for tour construction in the traveling salesman problem: The vigilant net (Q2563885):

Displaying 8 items.

• On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain (Q433075) (← links)
• Combined location-routing problems -- a neural network approach (Q1026597) (← links)
• The Guilty net for the traveling salesman problem (Q1200821) (← links)
• Neural methods for the traveling salesman problem: Insights from operations research (Q1345270) (← links)
• Design rules for application specific dynamical systems (Q1348553) (← links)
• A neural network algorithm for the multiple traveling salesman problem (Q1822984) (← links)
• Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches (Q1974282) (← links)
• A neural-network-based approach to the double traveling salesman problem. (Q2780866) (← links)