Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches
type: Item
instance of: scholarly article
title: Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches
zbMATH Open document ID: 0944.90007
DOI: 10.1016/S0305-0548(99)00065-9
author: Yanyan Li
published in: Computers \& Operations Research
publication date: 2000-09-26T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1439520
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: euclidean hamiltonian path problem
zbMATH Keywords: neural solutions
zbMATH Keywords: Kohonen's self-organizing map
zbMATH Keywords: self-organizing neural network
Wikidata QID: Q60328116
describes a project that uses: TSPLIB
MaRDI profile type: Publication
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: The Euclidean traveling salesman problem is NP-complete
cites work: Q5187226
cites work: The traveling salesman. Computational solutions for RSP applications
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Q4326408
cites work: Q4365133
cites work: State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
cites work: Q4875843
cites work: Q4315008
cites work: Easing the conscience of the guilty net
cites work: ``Neural'' computation of decisions in optimization problems
cites work: A hierarchical strategy for solving traveling salesman problems using elastic nets
cites work: Self-organizing maps.
cites work: Q4403756
cites work: Q3998716
cites work: Asymptotic quantization error of continuous signals and the quantization dimension
cites work: Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
cites work: The Guilty net for the traveling salesman problem
cites work: Neural methods for the traveling salesman problem: Insights from operations research
cites work: ``Conscientious'' neural nets for tour construction in the traveling salesman problem: The vigilant net
cites work: Using Confidence Limits for the Global Optimum in Combinatorial Optimization
cites work: Interval estimation of a global optimum for large combinatorial problems
cites work: Extended Pattern Search with Transformations for the Three-Parameter Weibull MLE Problem
cites work: Statistical inference for bounds of random variables
cites work: Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
cites work: A simulation study of some simple estimators for the three-parameter weibull distribution
full work available at URL: s0305-0548(99)00065-9
OpenAlex ID: W2095513353
DBLP publication ID: journals/cor/AltinelAO00
description: scientific article; zbMATH DE number 1439520