Heuristic procedures for the m-partial cover problem on a plane

DOI10.1016/0377-2217(82)90109-6zbMath0495.52009OpenAlexW2043564626MaRDI QIDQ1169687

C. D. T. Watson-Gandy

Publication date: 1982

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(82)90109-6

zbMATH Keywords

weighted pointslocation of centersmaximizing the sum of weights

Mathematics Subject Classification ID

Integer programming (90C10) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (14)

The p-cover problem ⋮ Covering part of a planar network ⋮ Territorial design optimization for business sales plan ⋮ On the conditional \(p\)-median problem ⋮ The gradual covering decay location problem on a network. ⋮ Heuristic procedures for the m-partial cover problem on a plane ⋮ An iterated local search for the budget constrained generalized maximal covering location problem ⋮ Generalized coverage: new developments in covering location models ⋮ Finding a cluster of points and the grey pattern quadratic assignment problem ⋮ The generalized maximal covering location problem ⋮ On reserve and double covering problems for the sets with non-Euclidean metrics ⋮ The variable radius covering problem ⋮ Heuristic methods and applications: A categorized survey ⋮ The \(p\) maximal cover -- \(p\) partial center problem on networks

Cites Work

• Heuristic procedures for the m-partial cover problem on a plane
• The chromatic reduction problem
• An approximate solution method for the fixed charge problem
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Unnamed Item

This page was built for publication: Heuristic procedures for the m-partial cover problem on a plane