Improvement Procedures for the Undirected Rural Postman Problem

References

• Assad A. A. , Golden B. L. , Ball M. O. , Magnanti T. L. , Monma C. L. , Nemhauser G. L. Arc routing methods and applications. Network Routing (1995) (North-Holland, Amsterdam) 375 483 Handbooks in Operations Research and Management Science Crossref, Google Scholar
• Christofides N. Worst-case analysis of a new heuristic for the traveling salesman problem. (1976) . Report no. 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA Google Scholar
• Christofides N. , Campos V. , Corberán A. , Mota E. An algorithm for the rural postman problem. (1981) . Imperial College Report IC.O.R.81.5, London Google Scholar
• Corberán A. Private communication. (1998) Google Scholar
• Corberán A. , Sanchis J. M. On the general routing problem polyhedron: Facets from the GTSP and RPP polyhedra. (1991) . Working paper, Departamento de Estadística e Investigación Operativa, Universidad de Valencia, Spain Google Scholar
• Corberán A. , Sanchis J. M. A polyhedral approach to the rural postman problem. Eur. J. Oper. Res. (1994) 79 95 114 Crossref, Google Scholar
• Croes G. A. A method for solving traveling-salesman problems. Oper. Res. (1958) 6 791 812 Link, Google Scholar
• Edmonds J. , Johnson E. L. Matching, Euler tours and the Chinese postman problem. Math. Programming (1973) 5 88 124 Crossref, Google Scholar
• Eiselt H. A. , Gendreau M. , Laporte G. Arc routing problems, part II: The rural postman problem. Oper. Res. (1995) 43 399 414 Link, Google Scholar
• Frederickson G. N. Approximation algorithms for some postman problems. SIAM J. Comput. (1979) 7 178 193 Crossref, Google Scholar
• Gendreau M. , Hertz A. , Laporte G. New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. (1992) 40 1086 1094 Link, Google Scholar
• Hertz A. , Laporte G. , Mittaz M. A tabu search heuristic for the capacitated arc routing problem. Oper. Res. (1999) . In press Google Scholar
• Lenstra J. K. , Rinnooy Kan A. H. G. On general routing problems. Networks (1976) 6 273 280 Crossref, Google Scholar
• Lin S. Computer solutions of the traveling salesman problem. Bell System Tech. J. (1965) 44 2245 2269 Crossref, Google Scholar
• Sanchis J. M. El Poliedro del Problema del Cartero Rural (1990) . Ph.D. thesis, Universidad de Valencia, Spain Google Scholar