A globally convergent Lagrange and barrier function iterative algorithm for the traveling salesman problem

 DANG Chuangyin
 Department of Manufacturing Engineering & Engineering Management, City University of Hong Kong

 XU Lei
 Department of Computer Science & Engineering, Chinese University of Hong Kong
Search this Article
Author(s)

 DANG Chuangyin
 Department of Manufacturing Engineering & Engineering Management, City University of Hong Kong

 XU Lei
 Department of Computer Science & Engineering, Chinese University of Hong Kong
Journal

 Neural networks : the official journal of the International Neural Network Society

Neural networks : the official journal of the International Neural Network Society 14(2), 217230, 20010301
References: 15

1
 <no title>

CICHOCKI A.
Neural networks for optimization and signal processing, 1993
Cited by (25)

2
 Neural computation of decisions in optimization problems

HOPFIELD J.
Biological Cybernetics 52, 141152, 1985
Cited by (9)

3
 Comparison of the Hopfield scheme to the hybrid of Lagrange and transformation approaches for solving the traveling salesman problem

LAU K. M.
Proceedings of International IEEE Symposium on Intelligence in Neural and Biological Systems, 209217, 1995
Cited by (1)

4
 <no title>

Lawler E. L.
The Traveling Salesman Problem, 1985
Cited by (19)

5
 <no title>

MINOUX M.
Mathematical programming: theory and algorithms, 1986
Cited by (4)

6
 Neural relaxation dynamics

VAN DEN BERG J.
PhD Thesis, Erasmus University of Rotterdam, 1996
Cited by (1)

7
 A neural network algorithm for the multiple traveling salesman problem

WACHOLDER E.
Biological Cybernetics 61, 1119, 1989
Cited by (2)

8
 Combinatorial optimization neural nets based on a hybrid of Lagrange and transformation approaches

XU L.
Proceedings of World Congress on Neutral Networks, 399404, 1994
Cited by (1)

9
 Statistical physics algorithms that converge

YUILLE A.
Neural Computation 6, 241356, 1994
Cited by (1)

10
 An Analogue Approach to the Travelling Salesman Problem Using an Elastic Net Method

DURBIN Richard
Nature 326, 689691, 1987
DOI Cited by (52)

11
 A note on solution of large sparse maximum entropy problems with linear equality constraints

ERIKSSON J.
Mathematical Programming 18, 146154, 1980
Cited by (1)

12
 Entropy in linear programs

ERLANDER S.
Mathematical Programming 21, 137151, 1981
Cited by (1)

13
 Linearlyconstrained entropy maximization problem with quadratic cost and its applications to transportation planning problems

FANG S. C.
Transportation Science 29, 353365, 1995
Cited by (1)

14
 A Novel Optimizing Network Architecture with Applications

RANGARAJAN A.
Neural Computation 8, 10411060, 1996
DOI Cited by (4)

15
 Convergence properties of the softassign quadratic assignment algorithm

RANGARAJAN A.
Neural Computation 11, 14551474, 1999
Cited by (1)