The Maximum Travelling Salesman Problem on symmetric Demidenko matrices
Under an Elsevier user license
open archive
MSC
primary: 90C27
Keywords
Travelling salesman problem
Demidenko condition
Kalmanson condition
Supnick condition
Combinatorial optimization
Computational complexity
Polynomial algorithm
Cited by (0)
- 1
On leave from Department of Applied Mathematics, Dnepropetrovsk University, Gagarin Av. 72, 320625 Dnepropetrovsk, Ukraine.
- 2
Supported by the START program Y43-MAT of the Austrian Ministry of Science.
Copyright © 2000 Elsevier Science B.V. All rights reserved.