Algoritmos Heurísticos de Cobertura de Arcos

[Lap97] Laporte, G. , Modeling and Solving Several Classes of Arc Routing Problems as
Traveling Salesman Problems, Computers & Operations Research, Vol.24, No.
11, 1997
[Law76] Lawler, E, Combinatorial Optimization, Networks and Matroids, Holt, Rinehart
and Winston, 1976.
[Let96] Letchford, A. N., New Inequalities for the General Routing Problem, European
Journal of Operational Research, Vol.96, pag: 317-322, 1996.
[Let98] Letchford, A. N., Eglese, R. W., The Rural postman Problem With Deadline
Classes, European Journal of Operational Research, Vol.105, pag: 390-400, 1998.
[Let99] Letchford, A. N., A General Routing Polyhedron: A Unifying Framework,
European Journal of Operational Research, Vol.112, pag: 122-133, 1999.
[Li 96] Li, L. Y. O., Eglese, R. W., An Interactive Algorithm for Vehicle Routing for
Winter-Gritting, Journal of Operational Research Society, Vol.47, pag: 217-228,
1996.
[Lin88] Lin Y, Zhao Y, A New Algorithm for the Directed Chinese Postman Problem,
Comput.Opns. Res. Vol.15, No. 6, 1988
[Mal89] Malek M., Mourad A., Pandya M., Topological Testing. Proceedings of the
IEEE 1989 International Test Conference, paper 4.4, 103-110, 1989.
[Mal93] Malandraki, C., Daskin, M. S., The Maximum Benefit Chinese Postman Problem
and the Maximum Benefit Traveling Salesman Problem, European Journal of
Operational Research, Vol.65, pag: 218-234, 1993.
[McB82] Richard McBride, Controlling Left and U-Turns in the Routing of Refuse
Collection Vehicles, Computers Ops Res. Vol.9, No. 2, 1982
[Min79] Edward Minieka, The Chinese Postman Problem for Mixed Networks,
Management Sciences, Vol 25, No. 7, 1979.
127