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

DOI10.1016/J.EJOR.2015.09.006MaRDI QIDQ322404zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

large scale optimizationlocationmean shiftplanar maximal covering location problem

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 4001209 (Why is no real title available?)
• A mixed integer formulation for maximal covering by inclined parallelograms
• A note on the convergence of the mean shift
• An exact algorithm for the maximal covering problem
• An extended continuous maximal covering location problem with facility placement
• Bicriterion Programs and Managerial Location Decisions: Application to the Banking Sector
• Continuous space maximal coverage: insights, advances and challenges
• Mean shift-based clustering
• The estimation of the gradient of a density function, with applications in pattern recognition

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)