Publication:4883162
From MaRDI portal
DOI<435::AID-NAV8>3.0.CO;2-A 10.1002/(SICI)1520-6750(199604)43:3<435::AID-NAV8>3.0.CO;2-AzbMath0846.90076MaRDI QIDQ4883162
Jeffrey D. Camm, Brian T. Downs
Publication date: 1 July 1996
Lagrangian relaxation; branch-and-bound; bounding schemes; greedy heuristics; maximal covering problem; dual-based solution methods; robust, exact algorithm
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
90B80: Discrete location and assignment
90C09: Boolean programming
Related Items
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, A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem, Emergency service systems: The use of the hypercube queueing model in the solution of probabilistic location problems