The convex-hull-and-k-line travelling salesman problem

Information Processing Letters

Volumn 59, Issue 6, 1996, Pages 295-301

  Deǐneko, Vladimir G ^a,c   Woeginger, Gerhard J ^a,b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c OLES HONCHAR DNIPRO NATIONAL UNIVERSITY   (Ukraine)

Author keywords

Combinatorial optimization; Combinatorial problems; Polynomial algorithm; Travelling salesman problem

Indexed keywords

COMBINATORIAL MATHEMATICS; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

POLYNOMIAL TIME SOLUTION; TRAVELLING SALESMAN PROBLEM (TSP);

ALGORITHMS;

EID: 0030234501     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00125-1     Document Type: Article

References (8)

1. M. Cutler, Efficient special case algorithms for the N-line planar traveling salesman problem, Networks 10 (1980) 183-195.
2. V. Deǐneko, R. Van Dal and G. Rote, The convex-hull-and-line traveling salesman problem: A solvable case, Inform. Process. Lett. 51 (1994) 141-148.
3. M.M. Flood, The traveling salesman problem, Oper. Res. 4 (1956) 61-75.
4. P.C. Gilmore, E.L. Lawler and D.B. Shmoys, Well-solved special cases, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, The Travelling Salesman Problem (Wiley, Chichester, 1985), Chapter 4, pp. 87-143..
5. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, The Travelling Salesman Problem (Wiley, Chichester, 1985).
6. S. Lin and B.W. Kernighan, An effective heuristic algorithm for the traveling salesman problem, Oper. Res. 21 (1973) 498-516.
7. C.H. Papadimitriou, The Euclidean travelling salesman problem is NP-complete, Theoret. Comput. Sci. 4 (1977) 237-244.
8. G. Rote, The N-line traveling salesman problem, Networks 22 (1992) 91-108.