Well-solved cases of the 2-peripatetic salesman problem

References

• Barth , D. and Raspaud , A. Two edge disjoint hamiltonian cycles in the butterfly graph . Information Processing Letters , 51 175 – 179 .
   Google Scholar
• Burkard , R.E. and Sandholzer , W. 1991 . Efficiently solvable special cases of bottleneck traveling salesman problems . Discrete Applied Mathematics , 32 : 61 – 76 .
   Google Scholar
• Deineko , V.G. , Van Dal , R. and Rote , G. 1994 . The convex-hull-and-line Traveling Salesman Problem A solvable case . Information Processing Letters , 51 : 141 – 148 .
   Web of Science ®Google Scholar
• Gabovitch , E. ja . 1970 . The small Traveling Salesman Problem . Trudy vycisl. Centra Tartu.Gos. Univ , 19 : 27 – 51 . in Russian
   Google Scholar
• Garey , M.R. and Johnson , D.S. 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness Edited by: Freeman , W.H. San Francisco
   Google Scholar
• Garfinkel , R.S. 1977 . Minimizing wallpaper waste, part 1: A cass of traveling salesman problems . Operations Research , 25 : 741 – 751 .
   Google Scholar
• Gilmore , P.C. , Lawler , E.L. and Shmoys , D.B. 1985 . Well-solved special cases in the traveling Salesman Problem , Edited by: Lawler , E.L. , Lenstra , J.K. , Rinnooy Kan , A.H.G. and Shmoys , D.B. 87 – 143 . Chichester : Wiley .
   Google Scholar
• de Kort , J.B.J.M. 1992 . Edge-disjointness in Combinatorial Optimization , Amsterdam : University of Amsterdam, Thesis Publishers . Ph.D. Thesis
   Google Scholar
• de Kort , J.B.J.M. 1993 . A branch and bound algorithm for symmetric 2-peripatetic salesman problems . European Journal of Operational Research , 70 : 229 – 243 .
   Web of Science ®Google Scholar
• Krarup , J. 1975 . “ The peripatetic salesman and some related unsolved problems ” . In Combinatorial programming: methods and applications , Edited by: Roy , B. 173 – 178 . Dordrecht : Reidel Publishing Company .
   Google Scholar
• Pearn , W.L. 1994 . Solvable cases of the k-person Chinese postman problem . Operations Research Letters , 16 : 241 – 244 .
   Google Scholar
• van der Veen , J.A.A. 1993 . An O(n) algorithm to solve the Traveling Salesman Problem restricted to ordered product matrices . Discrete Applied Mathematics , 47 : 57 – 75 .
   Web of Science ®Google Scholar