A mean-shift algorithm for large-scale planar maximal covering location problems

DOI10.1016/j.ejor.2015.09.006zbMath1346.90498OpenAlexW1866106631WikidataQ125965018 ScholiaQ125965018MaRDI QIDQ322404

Chin-Hon Tan, Shou-Yang Wang, Bo Fan, Zhou He, Cheng, T. C. Edwin

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

zbMATH Keywords

locationlarge scale optimizationmean shiftplanar maximal covering location problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (6)

Optimization models for cloud seeding network design and operations ⋮ Multi-type maximal covering location problems: hybridizing discrete and continuous problems ⋮ Efficient presolving methods for solving maximal covering and partial set covering location problems ⋮ A practical heuristic for maximum coverage in large-scale continuous location problem ⋮ Optimizing source and receiver placement in multistatic sonar networks to monitor fixed targets ⋮ Parallel attribute reduction in dominance-based neighborhood rough set

Cites Work

• Unnamed Item
• Continuous space maximal coverage: insights, advances and challenges
• A note on the convergence of the mean shift
• An extended continuous maximal covering location problem with facility placement
• A mixed integer formulation for maximal covering by inclined parallelograms
• Mean shift-based clustering
• The estimation of the gradient of a density function, with applications in pattern recognition
• Bicriterion Programs and Managerial Location Decisions: Application to the Banking Sector
• An exact algorithm for the maximal covering problem

This page was built for publication: A mean-shift algorithm for large-scale planar maximal covering location problems