Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches

DOI10.1016/S0305-0548(99)00065-9zbMath0944.90007OpenAlexW2095513353WikidataQ60328116 ScholiaQ60328116MaRDI QIDQ1974282

Yanyan Li

Publication date: 26 September 2000

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00065-9

zbMATH Keywords

combinatorial optimizationtraveling salesman problemself-organizing neural networkeuclidean hamiltonian path problemKohonen's self-organizing mapneural solutions

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (1)

Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ``Neural computation of decisions in optimization problems
• Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
• The Guilty net for the traveling salesman problem
• The Euclidean traveling salesman problem is NP-complete
• The traveling salesman. Computational solutions for RSP applications
• Easing the conscience of the guilty net
• Neural methods for the traveling salesman problem: Insights from operations research
• A hierarchical strategy for solving traveling salesman problems using elastic nets
• ``Conscientious neural nets for tour construction in the traveling salesman problem: The vigilant net
• A simulation study of some simple estimators for the three-parameter weibull distribution
• Using Confidence Limits for the Global Optimum in Combinatorial Optimization
• Extended Pattern Search with Transformations for the Three-Parameter Weibull MLE Problem
• Asymptotic quantization error of continuous signals and the quantization dimension
• TSPLIB—A Traveling Salesman Problem Library
• Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
• Interval estimation of a global optimum for large combinatorial problems
• Statistical inference for bounds of random variables
• State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Self-organizing maps.

This page was built for publication: Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches