The Library
On the Euclidean TSP with a permuted Van der Veen matrix
Tools
Tools
Tools
UNSPECIFIED. (2004) On the Euclidean TSP with a permuted Van der Veen matrix. INFORMATION PROCESSING LETTERS, 91 (6). pp. 259-262. ISSN 0020-0190
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.ipl.2004.05.011
Abstract
We discuss the problem of recognizing permuted Van der Veen (VdV) matrices. It is well known that the TSP with a VdV matrix as distance matrix is pyramidally solvable. In this note we solve the problem of recognizing permuted strong VdV matrices. This yields an O(n(4)) time algorithm for the TSP with a permuted Euclidean VdV matrix. The problem, however, of recognizing permuted VdV matrices in general remains open. (C) 2004 Elsevier B.V. All rights reserved.
| Item Type: | Journal Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software |
| Journal or Publication Title: | INFORMATION PROCESSING LETTERS |
| Publisher: | ELSEVIER SCIENCE BV |
| ISSN: | 0020-0190 |
| Date: | 30 September 2004 |
| Volume: | 91 |
| Number: | 6 |
| Number of Pages: | 4 |
| Page Range: | pp. 259-262 |
| Identification Number: | 10.1016/j.ipl.2004.05.011 |
| Publication Status: | Published |
| URI: | http://wrap.warwick.ac.uk/id/eprint/8078 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
