A Lagrange Multiplier and Hopfield-Type Barrier Function Method for the Traveling Salesman Problem

DOI10.1162/08997660252741130zbMath0995.90079OpenAlexW2160321968WikidataQ52047962 ScholiaQ52047962MaRDI QIDQ2780855

Chuangyin Dang, Lei Xu

Publication date: 6 June 2002

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/08997660252741130

zbMATH Keywords

traveling salesman problemLagrange multiplier and Hopfield-type barrier function method

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items

A deterministic annealing algorithm for approximating a solution of the min-bisection problem ⋮ Solving the TSP by the AALHNN algorithm ⋮ A deterministic annealing algorithm for the minimum concave cost network flow problem ⋮ Machine learning problems from optimization perspective

Cites Work

• A neural network algorithm for the multiple traveling salesman problem
• Neurons with graded response have collective computational properties like those of two-state neurons.