Computing approximate solutions of the maximum covering problem with GRASP
From MaRDI portal
Publication:1273660
DOI10.1023/A:1009677613792zbMath0913.90202MaRDI QIDQ1273660
Publication date: 6 January 1999
Published in: Journal of Heuristics (Search for Journal in Brave)
upper bound; GRASP; heuristic; facility location problems; greedy randomized adaptive search procedure; maximum covering
90B80: Discrete location and assignment
Related Items
Designing robust coverage networks to hedge against worst-case facility losses, Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms, Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems, Bayesian coverage optimization models, Fuzzy logic based algorithms for maximum covering location problems, A GRASP heuristic for the mixed Chinese postman problem, Solving two location models with few facilities by using a hybrid heuristic: a real health resources case, A GRASP and path relinking heuristic for rural road network development