The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms

References

• Applegate D., Bixby R., Chvátal V., Cook W. Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Math. Programming Ser. B (2003) 97:91–153Google Scholar
• Asef-Vaziri A., Laporte G. Loop based facility planning and material handling. Eur. J. Oper. Res. (2005) 164:1–11Crossref, Google Scholar
• Bauer D., Broersma H. J., Veldman H. J. On smallest non-Hamiltonian regular tough graphs. Congressus Numerantium (1990) 70:95–98Google Scholar
• Blazewicz J., Burkard R. E., Finke G., Woeginger G. J. Vehicle scheduling in two-cycle flexible manufactoring systems. Math. Comput. Model. (1994) 20:19–31Crossref, Google Scholar
• Dantzig G. B., Fulkerson D. R., Johnson S. M. Solution of a large-scale traveling salesman problem. Oper. Res. (1954) 2:393–410Link, Google Scholar
• De Kort J. B. J. M. Lower bounds for symmetric K-peripatetic salesman problems. Optimization (1991) 22:113–122Crossref, Google Scholar
• De Kort J. B. J. M. A branch and bound algorithm for symmetric 2-peripatetic salesman problems. Eur. J. Oper. Res. (1993) 70:229–243Crossref, Google Scholar
• Duchenne É., Laporte G., Semet F. Branch-and-cut algorithms for the undirected m-peripatetic salesman problem. Eur. J. Oper. Res. (2005) 162:700–712Crossref, Google Scholar
• Gopalan R., Batta R., Karwan M. H. The equity constrained shortest path problem. Comput. Oper. Res. (1990) 17:297–307Crossref, Google Scholar
• Grötschel M., Padberg M. W., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B. Polyhedral theory. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985) (Wiley, Chichester, UK) 251–305Google Scholar
• Kleitman D. J. Methods for investigating the connectivity of large graphs. IEEE Trans. Circuit Theory (1969) 16:232–233Crossref, Google Scholar
• Krarup J., Roy B. The peripatetic salesman and some related unsolved problems. Combinatorial Programming, Methods and Applications (1975) (Reidel, Dordrecht, The Netherlands) 173–178Google Scholar
• Lindner-Dutton L., Batta R., Karwan M. H. Equitable sequencing of a given set of hazardous materials shipments. Transportation Sci. (1991) 25:124–137Link, Google Scholar
• Lucas D. E.Récréations mathématiques (1892) II(Gauthiers Villars, Paris, France) Google Scholar
• Naddef D., Thienel S. Efficient separation routines for the symmetric traveling salesman problem I: General tools and comb separation. Math. Programming (2002) 92:237–255Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1999) (Wiley, New York) Google Scholar
• Padberg M. W., Grötschel M., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B. Polyhedral computations. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985) (Wiley, Chichester, UK) 307–360Google Scholar
• Reinelt G. TSPLIB—A traveling salesman problem library. ORSA J. Comput. (1991) 3:376–384Link, Google Scholar
• Venkataramanan M. A., Wilson K. A. A branch-and-bound algorithm for flow-path design of automated guided vehicle systems. Naval Res. Logist. (1991) 38:431–445Crossref, Google Scholar
• Wolfler Calvo R., Cordone R. A heuristic approach to the overnight security service problem. Comput. Oper. Res. (2003) 30:1269–1287Crossref, Google Scholar