A practical heuristic for maximum coverage in large-scale continuous location problem

DOI10.22124/jmm.2021.18624.1594zbMath1499.90114OpenAlexW3130579294MaRDI QIDQ5080078

Vahid Kiani, Mahdi Imanparast

Publication date: 31 May 2022

Full work available at URL: https://jmm.guilan.ac.ir/article_4635_43dd386994d4999be00212ee5bcfe838.pdf

zbMATH Keywords

facility locationcovering problemslarge-scale datasetscoverage radius

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (1)

Unnamed Item

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• A mean-shift algorithm for large-scale planar maximal covering location problems
• A mixed integer formulation for maximal covering by inclined parallelograms
• The large-scale dynamic maximal covering location problem
• A bibliography for some fundamental problem categories in discrete location science
• An exact algorithm for the maximal covering problem
• Planar maximal covering location problem under block norm distance measure
• Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones

This page was built for publication: A practical heuristic for maximum coverage in large-scale continuous location problem