You are on page 1of 5

Bibliografa

[01] Angel Corbern, Jos Mara Sanchis (2006). La combinatoria polidrica y los problemas de rutas de vehculos. [02] Aida Calvio Martinez (2011). Cooperacin en los problemas del viajante (TSP) y de rutas de vehculos (VRP): una panormica. [03] Juan Guillermo Villegas, Diana Catalina Lopera (2007). Problemas de Enrutamiento: variantes, aplicaciones y bibliografa bsica. [04] Carolina Yolanda Castaeda (2000). Estudio comparative de diversos mtodos de solucin del problema del agente viajero (PAV). [05] Prakash, S. ; Sharma, M.K. ; Singh, A. 2009 A heuristic for multi-objective Chinese postman problema. Computers & Industrial Engineering. 2009, pp. 596 599. <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=5223529&conte ntType=Conference+Publications&searchField%3DSearch_All%26queryText%3Dc hinese+postman+problem> [06] Jinghao Sun 2011 Branch-and-bound algorithm for the time dependent Chinese Postman Problem. Mechatronic Science, Electric Engineering and Computer (MEC). 2011, pp. 949 954. <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6025622&conte ntType=Conference+Publications&searchField%3DSearch_All%26queryText %3Dchinese+postman+problem> [07] Guozhen Tan 2005 Chinese Postman Problem in Stochastic Networks. Autonomic and Autonomous Systems and International Conference on Networking and Services. 2005, pp.78.

<http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=1559930&conte ntType=Conference+Publications&searchField%3DSearch_All%26queryText %3Dchinese+postman+problem> [08] Jinghao Sun 2011 Column Generation Approach for the Time Dependent Chinese Postman Problem. Computational Sciences and Optimization (CSO). 2011, pp. 450 454. <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=5957700&conte ntType=Conference+Publications&searchField%3DSearch_All%26queryText %3Dchinese+postman+problem> [09] Jinghao Sun 2011 Graph transformation algorithm for the time dependent Chinese Postman Problem with Time Windows. Mechatronic Science, Electric Engineering and Computer (MEC). 2011, pp. 955-960. <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6025623&conte ntType=Conference+Publications&searchField%3DSearch_All%26queryText %3Dchinese+postman+problem> [10] Yin Zhixiang 2004 Improved DNA algorithm of Chinese postman problem. Intelligent Control and Automation. 2004, Vol. 3, pp. 2313 2317. <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=1342003&conte ntType=Conference+Publications&searchField%3DSearch_All%26queryText %3Dchinese+postman+problem> [11] Zoraida, B.S.E. 2011 DNA Algorithm Employing Temperature Gradient for Chinese Postman Problem. Process Automation, Control and Computing (PACC). 2011, pp. 1 4.
-2-

<http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=5979046&conte ntType=Conference+Publications&searchField%3DSearch_All%26queryText %3Dchinese+postman+problem> [12] Mitra, D. 2010 Testing of Digital Microfluidic Biochips Using Improved Eulerization Techniques and the Chinese Postman Problem. Test Symposium (ATS). 2010, pp. 111 116. <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=5692232&conte ntType=Conference+Publications&searchField%3DSearch_All%26queryText %3Dchinese+postman+problem> [13] Aho, Alfred V. 1991 An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours. Communications, IEEE Transactions on. 1991, Vol. 39, pp. 1604 1615. <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=111442&conten tType=Journals+%26+Magazines&searchField%3DSearch_All%26queryText %3Dchinese+postman+problem> [14] Aili Han 2006 DNA Encoding Method of Weight for Chinese Postman Problem. Evolutionary Computation. 2006, pp. 681 686. <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=1688377&conte ntType=Conference+Publications&searchField%3DSearch_All%26queryText %3Dchinese+postman+problem> [15] Frederickson, G.N. 1976 Approximation algorithms for some routing problems. Foundations of Computer Science. 1976, pp. 216 227.

-3-

<http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=4567906&conte ntType=Conference+Publications&searchField%3DSearch_All%26queryText %3Dchinese+postman+problem> [16] Maamoun, K.M. 2010 Novel techniques for deploying monitoring trails (m-trails) for fault localization in all-optical networks. High-Capacity Optical Networks and Enabling Technologies (HONET). 2010, pp. 26 32. <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=5715768&conte ntType=Conference+Publications&searchField%3DSearch_All%26queryText %3Dchinese+postman+problem> [17] Mannadiar, R. 2010 Optimal coverage of a known arbitrary environment. Robotics and Automation (ICRA). 2010, pp. 5525 5530. <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=5509860&conte ntType=Conference+Publications&searchField%3DSearch_All%26queryText %3Dchinese+postman+problem> [18] Qing-Hu Wang 2009 DNA Algorithm Based on Incomplete Molecule Commixed Encoding for the Shortest Path Problem. Information Science and Engineering (ICISE). 2009, pp. 3641 3644. <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=5455134&conte ntType=Conference+Publications&searchField%3DSearch_All%26queryText %3Dchinese+postman+problem> [19] Dorigo, M. 1997 Ant colony system: a cooperative learning approach to the traveling salesman problem. Evolutionary Computation. 1977, pp. 53 66.

-4-

<http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=585892>

-5-

You might also like