Algoritmos Heurísticos de Cobertura de Arcos

[BTS03] Bureau of Transportation Statistics – BTS, www.bts.gov .
[Car80] Carpaneto G., e Toth P., Some New Branching and Bounding Criteria for the
Asymmetric Traveling Salesman Problem. Management Science, 26, 736-743,
1980.
[Cor00] Corberan, A. , Marti, R. , Romero, A. Heuristics for the Mixed Rural Postman
Problem, Computers & Operations Research, Vol.27, No. 2, pag: 183-203, 2000.
[Cor02] Corberán A., Martí R., Martinez E., e Soler D., The Rural Postman Problem on
Mixed Graphs with Turn Penalties, Computers & Operations Research Vol.29,
pag. 887 - 903, 2002.
[Cor94] Corberan, A. , Sanchis, J. M., A Polyhedral Approach to the Rural Postman
Problem, , European Journal of Operational Research, Vol.79, pag: 95-114, 1994.
[Cor98] Corberan, A. , Sanchis, J. M., The General Routing Problem Polyhedron: Facets
from the RPP and GTSP, European Journal of Operational Research, Vol.108,
pag: 538-550, 1998.
[Cri75] Christofides N., Graph Theory – An Algorithmic Approach. Academic Press,
London, 1975.
[Cri81] Christofides N., Campos V., Corberán A. e Mota E. An Algorithm for the Rural
Postman Problem. Imperial College Report IC.ºR.81.5, London, 1981.
[Cri84] Christofides N., Benavent E., Campos V., Corberán A. e Mota E. An Optimal
method for the Mixed Postman Problem. In: Thoft-Christensen P, editor. System
Modeling and Optimization, Lecture Notes in Control and Information Sciences,
vol. 59. Berlin: Springer, 1984.
[Cri86] Christofides N., Campos V., Corberán A. e Mota E. An Algorithm for the Rural
Postman Problem on a Directed Graph. Math. Programming Study. 26, 155-166,
1986.
[Dro97] Dror, M., Langevin, A. , A Generalized Traveling Salesman Problem Approach
to the Directed Clu stered Rural Postman Problem, Transportation Science,
Vol.31, No. 2 pag: 187-192, 1997.
124