The Maximum Coverage Location Problem
From MaRDI portal
Publication:3661269
DOI10.1137/0604028zbMath0514.90019OpenAlexW2570178494MaRDI QIDQ3661269
S. Louis Hakimi, Nimrod Megiddo, Eitan Zemel
Publication date: 1983
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0604028
Related Items
A maximal covering location model in the presence of partial coverage, A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage, Covering part of a planar network, Improved algorithms for some competitive location centroid problems on paths, trees and graphs, A branch and price approach for routing and refueling station location model, Democratic elections and centralized decisions: Condorcet and approval voting compared with median and coverage locations, A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices, \((r|p)\)-centroid problems on networks with vertex and edge demand, Multiple voting location and single voting location on trees, Continuous maximal covering location problems with interconnected facilities, The leader-follower location model, Fuzzy goal programming models for analyzing demand coverage, Maximum coverage problem with group budget constraints, The leader multipurpose shopping location problem, An exact method for the discrete \((r|p)\)-centroid problem, Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph, Discrete facility location in machine learning, Advanced network connectivity features and zonal requirements in covering location problems, An efficient model for the multiple allocation hub maximal covering problem, Optimal location of remote dental units, Efficient presolving methods for solving maximal covering and partial set covering location problems, The gradual covering decay location problem on a network., Sequential competitive location on networks, Mathematical programming models for determining the optimal location of beehives, Benders decomposition for very large scale partial set covering and maximal covering location problems, On locating new facilities in a competitive environment, On the overlap area of a disk and a piecewise circular domain, Voronoi game on graphs, An iterated local search for the budget constrained generalized maximal covering location problem, Improved complexity bounds for location problems on the real line, Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods, Evader interdiction: algorithms, complexity and collateral damage, Online budgeted maximum coverage, On domination and reinforcement numbers in trees, New algorithms for facility location problems on the real line, Multi-period stochastic covering location problems: modeling framework and solution approach, A dual bounding scheme for a territory design problem, The follower competitive location problem with comparison-shopping, An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees, On competitive sequential location in a network with a decreasing demand intensity, On the hardness of covering-interdiction problems, Performance bounds with curvature for batched greedy optimization, Mixed covering of trees and the augmentation problem with odd diameter constraints, The variable radius covering problem, Sequential location problems, \((r,p)\)-centroid problems on paths and trees, An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs, Perception and information in a competitive location model, Facility reallocation on the line, Covering Problems, Conditional Location Problems on Networks and in the Plane, The \(p\) maximal cover -- \(p\) partial center problem on networks, Bibliography on domination in graphs and some basic definitions of domination parameters
Cites Work
