Algoritmos Heurísticos de Cobertura de Arcos

[Mou00] Cândida Mourão, M., Teresa Almeida, M., Lower-Bounding and heuristic
methods for a refuse collection vehicle routing problem, European Journal of
Operational Research, Vol.121, pag: 420-434, 2000.
[Nob96] Yves Nobert, Jean-Claude Picard, An Optimal Algorithm for the Mixed Chinese
Postman Problem, Networks, Vol. 27, 1996
[Noo93] Noon C. E. e Bean J. C., An Efficient Transformation of the Generalized
Traveling Salesman Problem. INFOR, 31-44, 1993.
[Orl74] Orloff C. S., A Fundamental Problem in Vehicle Routing. Networks 4, 35-64,
1974.
[Pap76] Papadimitriou, C. H., On the Complexity of the Edge Traversing, J. Assoc.
Comput. Mach. 23, pag: 544-554, 1976.
[Pea87] Wen Lea Pearn, Transforming Arc Routing Into Node Routing Problems,
Computers Ops Res. Vol.14, No. 4, 1987
[Pea89] Wen Lea Pearn, Approximate Solutions for the Capacitated Arc Routing
Problem, Computers Ops Res. Vol.16, No. 6, 1989
[Pea91] Wen Lea Pearn, Augment-Insert Algorithms for the Capacitated Arc Routing
Problem, Computers Ops Res. Vol.18, No. 2, 1991
[Pea94] Pearn W L, Li M L, Algorithms for the Windy Postman Problem, Computers Ops
Res. Vol.21, No. 6, 1994
[Pea95.1] Wen Lea Pearn, C. M. Liu, Algorithms for the Chinese Postman Problem, On
Mixed Networks, Computers Ops Res. Vol.22, No. 5, 1995
[Pea95.2] Pearn, W. L., Wu, T. C., Algorithms For The Rural Postman Problem,
Computers & Operations Research, Vol.22, No. 8, pag: 819-828, 1995.
[Pea99] Pearn, W. L., Chou, J. B., Improved Solutions For The Chinese Postman
Problem on Mixed Network, Computers & Operations Research, Vol.26, No. 8,
pag: 819-827, 1999
128