The Library
The traveling salesman problem with few inner points
Tools
Tools
Tools
UNSPECIFIED (2006) The traveling salesman problem with few inner points. In: 10th International Computing and Combinatories Conference (COCOON 2004), Jeju Isl, SOUTH KOREA, AUG 17-20, 2004. Published in: OPERATIONS RESEARCH LETTERS, 34 (1). pp. 106-110.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.orl.2005.01.002
Abstract
We propose two algorithms for the planar Euclidean traveling salesman problem. The first runs in O(k!kn) time and O(k) space, and the second runs in O(2(k)k(2)n) time and O(2(k)kn) space, where n denotes the number of input points and k denotes the number of points interior to the convex hull. (c) 2005 Elsevier B.V. All rights reserved.
| Item Type: | Conference Item (UNSPECIFIED) |
|---|---|
| Subjects: | H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management |
| Journal or Publication Title: | OPERATIONS RESEARCH LETTERS |
| Publisher: | ELSEVIER SCIENCE BV |
| ISSN: | 0167-6377 |
| Date: | January 2006 |
| Volume: | 34 |
| Number: | 1 |
| Number of Pages: | 5 |
| Page Range: | pp. 106-110 |
| Identification Number: | 10.1016/j.orl.2005.01.002 |
| Publication Status: | Published |
| Title of Event: | 10th International Computing and Combinatories Conference (COCOON 2004) |
| Location of Event: | Jeju Isl, SOUTH KOREA |
| Date(s) of Event: | AUG 17-20, 2004 |
| URI: | http://wrap.warwick.ac.uk/id/eprint/34219 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
