A Lagrange Multiplier and Hopfield-Type Barrier Function Method for the Traveling Salesman Problem | Citedby Results | Neural Computation | MIT Press

Skip to Main Content

Skip Nav Destination

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

Neural Computation (2002) 14 (2): 303–324.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Robot Static Path Planning Method Based on Deterministic Annealing

Jinyu Dai
Jin Qiu
Haocheng Yu
Chunyang Zhang
Zhengtian Wu
Qing Gao

Machines (2022) 10 (8): 600.

Solving the TSP by the AALHNN algorithm

Yun Hu
Qianqian Duan

Mathematical Biosciences and Engineering (2022) 19 (4): 3427.

A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem

Chuangyin Dang
Jianqing Liang
Yang Yang

Neural Networks (2013) 39: 1.

A deterministic annealing algorithm for the minimum concave cost network flow problem

Chuangyin Dang
Yabin Sun
Yuping Wang
Yang Yang

Neural Networks (2011) 24 (7): 699.

Machine learning problems from optimization perspective

Lei Xu

Journal of Global Optimization (2010) 47 (3): 369.

A deterministic annealing algorithm for approximating a solution of the min-bisection problem

Chuangyin Dang
Wei Ma
Jiye Liang

Neural Networks (2009) 22 (1): 58.