GOAL: a clustering-based method for the group optimal location problem
- 19 December 2018
- journal article
- research article
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 61 (2) , 873-903
Abstract
No abstract availableKeywords
Funding Information
- the Key Disciplines of Computer Science and Technology of Shanghai Polytechnic University (XXKZD1604)
- the Research Project of Shanghai Polytechnic University (EGD18XQD02)
- Australian Research Council (ARC) Discovery Project (DP180103332)
- the cultural relic protection science and technology project of Zhejiang Province
- Key Research and Development Program of Zhejiang Province
- the NSFC under Grants (61522208)
- the ZJU-Hikvision Joint Project (None)
This publication has 30 references indexed in Scilit:
- Capacity constrained maximizing bichromatic reverse nearest neighbor searchExpert Systems with Applications, 2016
- Optimal Location Queries in Road NetworksACM Transactions on Database Systems, 2015
- On efficient k-optimal-location-selection query processing in metric spacesInformation Sciences, 2015
- Efficient algorithms for optimal location queries in road networks2014
- On the problem of k-coverage in mission-oriented mobile wireless sensor networksComputer Networks, 2012
- Maximizing Voronoi Regions of a Set of Points Enclosed in a Circle with Applications to Facility LocationJournal of Mathematical Modelling and Algorithms, 2010
- Facility location problems in the plane based on reverse nearest neighbor queriesEuropean Journal of Operational Research, 2010
- Improved Approximation Algorithms for Geometric Set CoverDiscrete & Computational Geometry, 2006
- Minimum-cost coverage of point sets by disks2006
- The Optimal-Location Query2005