Computing approximate solutions of the maximum covering problem with GRASP

DOI10.1023/A:1009677613792zbMath0913.90202OpenAlexW1872884446MaRDI QIDQ1273660

Mauricio G. C. Resende

Publication date: 6 January 1999

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009677613792

zbMATH Keywords

upper boundGRASPheuristicfacility location problemsgreedy randomized adaptive search proceduremaximum covering

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (14)

A joint replenishment inventory-location model ⋮ Siting renewable power generation assets with combinatorial optimisation ⋮ Solving two location models with few facilities by using a hybrid heuristic: a real health resources case ⋮ Intelligent-guided adaptive search for the maximum covering location problem ⋮ The leader multipurpose shopping location problem ⋮ Designing robust coverage networks to hedge against worst-case facility losses ⋮ Interactive optimization of submodular functions under matroid constraints ⋮ On the overlap area of a disk and a piecewise circular domain ⋮ Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms ⋮ Bayesian coverage optimization models ⋮ Fuzzy logic based algorithms for maximum covering location problems ⋮ Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems ⋮ A GRASP heuristic for the mixed Chinese postman problem ⋮ A GRASP and path relinking heuristic for rural road network development

This page was built for publication: Computing approximate solutions of the maximum covering problem with GRASP