Iterated Greedy Algorithms for the Maximal Covering Location Problem

DOI10.1007/978-3-642-29124-1_15zbMath1292.90173OpenAlexW2128144519MaRDI QIDQ3164918

Manuel Lozano, Christian Blum, Francisco J. Rodriguez, Carlos García-Martínez

Publication date: 18 October 2012

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29124-1_15

zbMATH Keywords

large neighbourhood searchiterated greedy algorithmmaximal covering location problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (1)

Intelligent-guided adaptive search for the maximum covering location problem

This page was built for publication: Iterated Greedy Algorithms for the Maximal Covering Location Problem