An exact algorithm for the maximal covering problem

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199604)43:3<435::AID-NAV8>3.0.CO;2-A" /><435::AID-NAV8>3.0.CO;2-A 10.1002/(SICI)1520-6750(199604)43:3<435::AID-NAV8>3.0.CO;2-AzbMath0846.90076OpenAlexW2081384553MaRDI QIDQ4883162

Brian T. Downs, Jeffrey D. Camm

Publication date: 1 July 1996

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199604)43:3<435::aid-nav8>3.0.co;2-a

zbMATH Keywords

Lagrangian relaxationbranch-and-boundbounding schemesgreedy heuristicsmaximal covering problemdual-based solution methodsrobust, exact algorithm

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (11)

A mean-shift algorithm for large-scale planar maximal covering location problems ⋮ Intelligent-guided adaptive search for the maximum covering location problem ⋮ Efficient presolving methods for solving maximal covering and partial set covering location problems ⋮ Benders decomposition for very large scale partial set covering and maximal covering location problems ⋮ On the overlap area of a disk and a piecewise circular domain ⋮ A practical heuristic for maximum coverage in large-scale continuous location problem ⋮ A mixed integer linear program and tabu search approach for the complementary edge covering problem ⋮ Bayesian coverage optimization models ⋮ Fuzzy logic based algorithms for maximum covering location problems ⋮ Emergency service systems: The use of the hypercube queueing model in the solution of probabilistic location problems ⋮ A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem

This page was built for publication: An exact algorithm for the maximal covering problem