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