Algoritmos Heurísticos de Cobertura de Arcos

[Gol83] B. L. Golden, J. S. Dearmon, Computational Experiments with Algorithms for a
Class of Routing Problems, Computers Ops Res. Vol.14, No. 1, 1983
[Gro92] Grotschel, M., Win, Z., A Cutting plane Algorithm for the Windy Postman
Problem, Mathematical Programming, Vol. 55, pag: 339-358, 1992.
[Gua62] Guan M K, Graphic programming using odd or even points. Chinese Math. 1,
273-277, 1962.
[Gua84] Guan M. K. On the Windy Postman Problem. Discrete Appl. math. 9, 41-46,
1984.
[Ham97] Herbert Hamers, Theory and Methodology On the Concavity of delivery Games,
European Journal of Operational Research 99, 1997
[IBG03] Instituto Brasileiro de Geografia e Estatística – IBGE, www.gov.br .
[Ita81] Itai A., Lipton R. J., Papadimitriou C. H., Rodeh M., Covering Graphs by Simple
Circuits. SIAM J. Comp. 10, 746-750, 1981.
[Joh97] Johnson, D. S., McGeoch, L. A., The Traveling Salesman Problem: a Case Study,
Aarts, E. & Lenstra, J. K. (eds). Local Search in Combinatorial Optimization,
Wiley, New York, pag: 215-310, 1997.
[Kap79] Kappauf C. H. e Koehler G. J., The Mixed Postman Problem. Discr. Appl. Math.
1, 89-103, 1979.
[Kar72] Karp R., Reducibility Among Combinatorial Problems. Complexity of Computer
Computations, Edited by R. Miller and J. Thatcher, 85-104, Plenum Press, New
York, 1972.
[Kar79] Karp R. M., A patching Algorithm for the Nonsymetric Traveling salesman
Problem. SIAM Journal on Computing, 8, 561-573, 1979.
[Kes87] Kesel’man D. Y., Covering the Edges of a Graph by Circuits. Kibernética 3, 16-
22, 1987.
126