An efficient method for single-facility location and path-connecting problems in a cell map

Author：        

Publisher： Taylor & Francis Ltd

ISSN： 1365-8824

Source： International Journal of Geographical Information Science, Vol.27, Iss.10, 2013-10, pp. : 2060-2076

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

Exact cell decomposition on base map features for optimal path finding

By Pun-Cheng L. S. C.   Tang M. Y. F.   Cheung I. K. L.  

International Journal of Geographical Information Science, Vol. 21, Iss. 2, 2007-01 ,pp. : 175-185

Taylor & Francis Ltd

Access to resources Recommend Favorite

Efficient Location Privacy-Preserving k-Anonymity Method Based on the Credible Chain

By Wang Hui   Huang Haiping   Qin Yuxiang   Wang Yunqi   Wu Min  

ISPRS International Journal of Geo-Information, Vol. 6, Iss. 6, 2017-06 ,pp. : 163-163

MDPI

Access to resources Recommend Favorite

An evolutionary algorithm for multicriteria path optimization problems

By Mooney Peter   Winstanley Adam  

International Journal of Geographical Information Science, Vol. 20, Iss. 4, 2006-04 ,pp. : 401-423

Taylor & Francis Ltd

Access to resources Recommend Favorite

Emergent macrostructures of path-dependent location adoptions processes of firms

By Lai Shih-Kung  

The Annals of Regional Science, Vol. 40, Iss. 3, 2006-08 ,pp. : 545-558

Springer Publishing Company

Access to resources Recommend Favorite

A method for building displacement in automated map generalisation

By Ruas Anne  

International Journal of Geographical Information Science, Vol. 12, Iss. 8, 1998-12 ,pp. : 789-803

Taylor & Francis Ltd

Access to resources Recommend Favorite