On the stability of the travelling salesman problem algorithm of Hopfield and Tank
From MaRDI portal
Publication:1098576
DOI10.1007/BF00363956zbMath0637.65062OpenAlexW2010863474WikidataQ52253214 ScholiaQ52253214MaRDI QIDQ1098576
George V. Wilson, G. Stuart Pawley
Publication date: 1988
Published in: Biological Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00363956
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)
Related Items
A neural network model as a globally coupled map and applications based on chaos, Solving the TSP by the AALHNN algorithm, Solving the Hamiltonian cycle problem via an artificial neural network, Solving the \(N\)-queens problem with a binary Hopfield-type network. Synchronous and asynchronous model, Design rules for application specific dynamical systems, Solving optimization problems with variable-constraint by an extended Cohen-Grossberg model, A unified constructive network model for problem-solving, Neural networks and heuristic search, Local search with memory: Benchmarking RTS, A hybrid neural approach to combinatorial optimization, Metaheuristics: A bibliography, Neural-net computing and the intelligent control of systems, Computational abilities of a chaotic neural network, Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme, A study of the transiently chaotic neural network for combinatorial optimization., Introduction to computation and learning in artificial neural networks, Solving optimisation problems using neucomp-a neural network compiler, Dynamical Analysis of Continuous Higher-Order Hopfield Networks for Combinatorial Optimization, FINITE SIZE SCALING AND CRITICAL TRANSITION IN CONSTRAINED TRAVELING SALESMAN PROBLEM, Neural networks for NP-complete problems, Neural network methods in combinatorial optimization, Scheduling with neural networks -- the case of the Hubble Space Telescope, A connectionist approach to the quadratic assignment problem, Recurrent neural networks for linear programming: Analysis and design principles, Solving combinatorial optimization problems using augmented Lagrange chaotic simulated annealing, An intelligent algorithm for mixed-integer programming models, A columnar competitive model for solving multi-traveling salesman problem, An expert neural network system for dynamic job shop scheduling, Ordinal optimization and quantification of heuristic designs, Stability analysis of Hopfield neural networks with uncertainty, Interacting Brownian Particles as a Model of Neural Network, Convergence and Stability of Quantized Hopfield Networks Operating in a Fully Parallel Mode, On problem solving with Hopfield neural networks, Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem, Massively parallel analog tabu search using neural networks applied to simple plant location problems, Mixed Tabu machine for portfolio optimization problem, Solution of the optimization problem using the neural network model as a globally coupled map, A higher order Hopfield network for vector quantisation, Solving large scale combinatorial optimization problems based on a divide and conquer strategy, Markovian neural networks, A study of the application of Kohonen-type neural networks to the travelling salesman problem, A review of Hopfield neural networks for solving mathematical programming problems, ``Conscientious neural nets for tour construction in the traveling salesman problem: The vigilant net, The impact of energy function structure on solving generalized assignment problem using Hopfield neural network, Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge, Annealed chaotic neural network with nonlinear self-feedback and its application to clustering problem, Delayed transiently chaotic neural networks and their application, Differential-algebraic approach to linear programming, Modelling competitive Hopfield networks for the maximum clique problem
Cites Work
