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

Neural Networks

Volumn 14, Issue 2, 2001, Pages 217-230

  Dang, Chuangyin ^a   Xu, Lei ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Descent direction; Entropy type barrier function; Iterative algorithm; Lagrange multiplier; Traveling salesman problem

Indexed keywords

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; ENTROPY; PRIORITY JOURNAL; PROBLEM SOLVING; TRAVEL;

ALGORITHMS; ENTROPY; MODELS, BIOLOGICAL;

EID: 0035135850     PISSN: 08936080     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-6080(00)00092-7     Document Type: Article

References (15)

1. An analogue approach to the traveling salesman problem using an elastic network method
2. A note on solution of large sparse maximum entropy problems with linear equality constraints
3. Entropy in linear programs
4. Linearly-constrained entropy maximization problem with quadratic cost and its applications to transportation planning problems
5. Neural computation of decisions in optimization problems
6. Comparison of the Hopfield scheme to the hybrid of Lagrange and transformation approaches for solving the traveling salesman problem
7. A novel optimizing network architecture with applications
8. Convergence properties of the softassign quadratic assignment algorithm
9. A neural network algorithm for the multiple traveling salesman problem
10. Combinatorial optimization neural nets based on a hybrid of Lagrange and transformation approaches
11. Statistical physics algorithms that converge