Algoritmos Heurísticos de Cobertura de Arcos

IX - Referências
[App95] Applegate D., Bixby R. E., Chvátal V., Cook W., Finding Cuts in the TSP: a
Preliminary Report, report 95-05, dimacs, Rutgers University, New Brunswick,
NJ, 1995.
[Bar90] Barahona F., On Some Applications of the Chinese Postman Problem.
Algorithms and Combinatorics, Vol 9, Path, Flows VLSI Layout, B. Korte et al.
eds. Springer-Verlag, Berlin, 1990.
[Bel74] Beltrami E. J., Bodin L. D., Networks and Vehicle Routing for Municipal Waste
Collection. Networks 4, 65-94, 1974.
[Ben03.1] Benavent E., Carrotta A., Corberán A., Sanchis J.M., e Vigo D., Lower Bounds
and Heuristics for the Windy Rural Postman Problem, Artigo de trabalho,
Universidade de Valência, Espanha, Março de 2003.
[Ben03.2] Benavent E., Corberán A., Piñana E., Plana I., e Sanchis J.M. New Heuristic
Algorithms for the Windy Rural Postman Problem, Artigo de trabalho,
Universidade de Valência, Espanha, Maio de 2003.
[Ber96] Van Den Berg, J. P., Multiple Order Pick Sequencing in a carousel System: A
Solvable Case of rural Postman Problem, Journal of Operational Research
Society, Vol.47, pag: 1504-1515, 1996.
[Bod78] Lawrence D. Bodin, Samuel J. Kursh, A Computer-Assisted System for the
Routing and Scheduling of Street Sweepers, Operations Research, Vol. 26,
No. 4, 1978
[Bod79] Lawrence D. Bodin, Samuel J. Kursh, A Detailed description of A Computer
System For the Routing and Scheduling of Street Sweepers, Comput. Ops Res.
Vol.6, 1979
[Bod83] Bodin L., Golden B., Assad A., Ball M., Routing and Scheduling of Vehicles
and Crews – The State of the Art., Computers & Operations Research, Vol.10,
No. 2, 1983.
123