The Directed Rural Postman Problem with Turn Penalties

References

• Assad A. , Golden B. , Ball M. O. , Magnanti T. L. , Monma C. L. , Neuhauser G. L. Arc routing methods and applications. Handbooks in OR and MS (1995) 8 (North-Holland, Amsterdam) Google Scholar
• Ball M. O. , Magazine M. J. Sequencing of insertions in printed circuit board assembly. Opns. Res. (1988) 36 192 201 Link, Google Scholar
• Bodin L. , Kursh S. A computer-assisted system for the routing and scheduling of street sweepers. Opns. Res. (1978) 26 525 537 Link, Google Scholar
• Bodin L. , Kursh S. A detailed description of a computer system for the routing and scheduling of street sweepers. Comput. Opns. Res. (1979) 6 181 198 Crossref, Google Scholar
• Bodin L. , Fagin G. , Welebny R. , Greenberg J. The design of a computerized sanitation vehicle routing and scheduling system for the town of oyster bay, new york. Comput. Opns. Res. (1989) 16 45 54 Crossref, Google Scholar
• Caldwell T. On finding minimal routes in a network with turn penalties. Comm. ACM (1961) 107 108 Google Scholar
• Campos V. , Savall J. V. A computational study of several heuristics for the DRPP. Comput. Optim. Appl. (1995) 4 67 77 Crossref, Google Scholar
• Christofides N. , Campos V. , Corberán A. , Mota E. An algorithm for the rural postman problem on a directed graph. Math. Program. (1986) 26 155 166 Crossref, Google Scholar
• Eiselt H. , Gendreau M. , Laporte G. Arc routing problems. Part I: The Chinese postman problem. Opns. Res. (1995a) 43 231 242 Link, Google Scholar
• Eiselt H. , Gendreau M. , Laporte G. Arc routing problems. Part II: the rural postman problem. Opns. Res. (1995b) 43 399 414 Link, Google Scholar
• Fischetti M. , Toth P. An additive bounding procedure for the asymmetric travelling salesman problem. Math. Program. (1992) 53 173 197 Crossref, Google Scholar
• Garey M. , Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman and Company, San Francisco) Google Scholar
• Kirby R. F. , Potts R. B. The minimum route problem for networks with turn penalties and prohibitions. Transportation Res. (1969) 3 397 408 Crossref, Google Scholar
• Laporte G. The traveling salesman problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. (1992) 59 231 247 Crossref, Google Scholar
• Mcbride R. Controlling lefts and U-turns in the routing of refuse collection vehicles. Comp. Opns. Res. (1982) 9 145 152 Crossref, Google Scholar
• Papadimitriou C. H. , Steiglitz K. Combinatorial Optimization: Algorithms and Complexity (1982) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Roy S. , Rousseau J. M. The capacitated Canadian postman problem. INFOR. (1989) 27 58 73 Google Scholar
• Soler D. Problemas de rutas por arcos con giros prohibidos. (1995) . Ph.D. thesis, Universitat de Valencia, Valencia, Spain Google Scholar