A mean-shift algorithm for large-scale planar maximal covering location problems
DOI10.1016/J.EJOR.2015.09.006zbMATH Open1346.90498OpenAlexW1866106631WikidataQ125965018 ScholiaQ125965018MaRDI QIDQ322404FDOQ322404
Authors: Zhou He, B. Fan, Shouyang Wang, Chin-Hon Tan, T. C. Edwin Cheng 
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.09.006
Recommendations
- The large-scale dynamic maximal covering location problem
- A maximal covering location model in the presence of partial coverage
- Planar maximum coverage location problem with partial coverage and rectangular demand and service zones
- Covering part of a planar network
- Planar maximal covering location problem under block norm distance measure
Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- The estimation of the gradient of a density function, with applications in pattern recognition
- An extended continuous maximal covering location problem with facility placement
- A mixed integer formulation for maximal covering by inclined parallelograms
- Mean shift-based clustering
- Continuous space maximal coverage: insights, advances and challenges
- Bicriterion Programs and Managerial Location Decisions: Application to the Banking Sector
- An exact algorithm for the maximal covering problem
- A note on the convergence of the mean shift
Cited In (9)
- Parallel attribute reduction in dominance-based neighborhood rough set
- Planar maximum coverage location problem with partial coverage and rectangular demand and service zones
- A practical heuristic for maximum coverage in large-scale continuous location problem
- Efficient presolving methods for solving maximal covering and partial set covering location problems
- Optimization models for cloud seeding network design and operations
- Planar maximal covering location problem under block norm distance measure
- Multi-type maximal covering location problems: hybridizing discrete and continuous problems
- The large-scale dynamic maximal covering location problem
- Optimizing source and receiver placement in multistatic sonar networks to monitor fixed targets
This page was built for publication: A mean-shift algorithm for large-scale planar maximal covering location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322404)
