Algoritmos Heurísticos de Cobertura de Arcos
Algoritmos Heurísticos de Cobertura de Arcos
Algoritmos Heurísticos de Cobertura de Arcos
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
[Pet77] J. P. Petersen, A Manual Procedure for Designing Mailman-Routes, Comput.<br />
Ops. Res.Vol.4, 1977<br />
[Rag99] Raghavachari B., Veerasamy J., A 3/2-Aproximation Algorithm For the Mixed<br />
Postman Problem, SIAM J. Discrete Math., Vol 12-4, Pag. 425-433, 1999.<br />
[Ral93] Ralph T. K., on the Mixed Chinese Postman Problem. Operations Research<br />
Letters, 14, 123-127, 1993.<br />
[Ric91] Richey M B, Parker R G, A cubic algorithm for the directed Eulerian sub graph<br />
problem, European Journal of Operational Research 50, 1991<br />
[Rod00] Rodrigues, M. A. P., Problema do Caixeiro Viajante, Um Algoritmo para<br />
Resolução <strong>de</strong> Problemas <strong>de</strong> Gran<strong>de</strong> Porte Baseado em Busca Local Dirigida –<br />
Dissertação <strong>de</strong> Mestrado, EPS, Universida<strong>de</strong> Fe<strong>de</strong>ral <strong>de</strong> Santa Catarina, Brasil,<br />
2000.<br />
[She88] Sherafat, H. Uma Solução para o Problema do Carteiro Chinês no Grafo Misto,<br />
Anais <strong>de</strong> XXI SBPO, Vol.1, pag: 157-170, 1988.<br />
[She96] Sherafat, H., Circuitos Eulerianos Sujeitos a Restrições nos Vértices, Anais <strong>de</strong><br />
XXVIII SBPO, Vol.2, pag: 575-580, 1996.<br />
[Ste79] Helman I. Stern, Moshe Dror, Routing Electric Meter Rea<strong>de</strong>rs, Comput. Ops Res.<br />
Vol.6, 1979<br />
[Vou99] Voudouris, C., Tsang, E. Gui<strong>de</strong>d Local Search and its Application to the<br />
Traveling Salesman Problem, European Journal of Operations Research 113, pag:<br />
469-499, 1999.<br />
[Win89] Win Z, On the Windy Postman Problem on Eulerian Graphs, Mathematical<br />
Programming 44, 1989<br />
129