A comprehensive survey on the quickest path problem

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.147, Iss.1, 2006-10, pp. : 5-21

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Path relinking for the vehicle routing problem

By Ho Sin Gendreau Michel

Journal of Heuristics, Vol. 12, Iss. 1-2, 2006-03 ,pp. : 55-72

Springer Publishing Company

Access to resources Recommend Favorite

ON THE PATH PLANNING PROBLEM IN THE VICINITY OF OBSTACLES

By Zomaya Albert Y. Wright Matt R. Nabham Tarek M.

Cybernetics and Systems, Vol. 29, Iss. 8, 1998-11 ,pp. : 807-868

Taylor & Francis Ltd

Access to resources Recommend Favorite

The permutation-path coloring problem on trees

By Corteel S. Valencia-Pabon M. Gardy D. Barth D. Denise A.

Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. : 119-143

Elsevier

Access to resources Recommend Favorite

Segmentation of Arabic Characters: A Comprehensive Survey

International Journal of Technology Diffusion (IJTD), Vol. 2, Iss. 4, 2011-10 ,pp. : 48-82

IGI Global_journal

Access to resources Recommend Favorite

Comprehensive Survey of the Hybrid Evolutionary Algorithms

International Journal of Applied Evolutionary Computation (IJAEC), Vol. 4, Iss. 2, 2013-04 ,pp. : 1-19

IGI Global_journal

Access to resources Recommend Favorite