Solving the TSP by the AALHNN algorithm

DOI10.3934/mbe.2022158zbMath1489.90004OpenAlexW4210346131MaRDI QIDQ2130400

Yun Hu, Qianqian Duan

Publication date: 25 April 2022

Published in: Mathematical Biosciences and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/mbe.2022158

zbMATH Keywords

TSPaugmented LagrangianHNNLagrange neural network algorithmNesterov acceleration technique

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (1)

Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem

Cites Work

• Unnamed Item
• Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
• A review of Hopfield neural networks for solving mathematical programming problems
• ``Neural computation of decisions in optimization problems
• On the stability of the travelling salesman problem algorithm of Hopfield and Tank
• A new mechanical approach to handle generalized Hopfield neural networks
• Solving the production transportation problem via a deterministic annealing neural network method
• A logarithmic descent direction algorithm for the quadratic knapsack problem
• A Lagrange Multiplier and Hopfield-Type Barrier Function Method for the Traveling Salesman Problem
• Lagrange programming neural networks
• Neurons with graded response have collective computational properties like those of two-state neurons.

This page was built for publication: Solving the TSP by the AALHNN algorithm