The Maximum Coverage Location Problem
From MaRDI portal
Publication:3661269
Cites work
- scientific article; zbMATH DE number 3634298 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
Cited in
(57)- Fuzzy goal programming models for analyzing demand coverage
- Discrete facility location in machine learning
- \((r|p)\)-centroid problems on networks with vertex and edge demand
- 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
- The leader multipurpose shopping location problem
- A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage
- Continuous maximal covering location problems with interconnected facilities
- Competitive location models: a review
- An efficient model for the multiple allocation hub maximal covering problem
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Multiple voting location and single voting location on trees
- Covering part of a planar network
- Multi-period stochastic covering location problems: modeling framework and solution approach
- Performance bounds with curvature for batched greedy optimization
- On locating new facilities in a competitive environment
- Advanced network connectivity features and zonal requirements in covering location problems
- Evader interdiction: algorithms, complexity and collateral damage
- Efficient presolving methods for solving maximal covering and partial set covering location problems
- A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
- On the overlap area of a disk and a piecewise circular domain
- The line-constrained maximum coverage facility location problem
- Sequential competitive location on networks
- On the hardness of covering-interdiction problems
- The gradual covering decay location problem on a network.
- On competitive sequential location in a network with a decreasing demand intensity
- Mathematical programming models for determining the optimal location of beehives
- An exact method for the discrete \((r|p)\)-centroid problem
- Mixed covering of trees and the augmentation problem with odd diameter constraints
- 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
- The leader-follower location model
- A maximal covering location model in the presence of partial coverage
- On domination and reinforcement numbers in trees
- Conditional Location Problems on Networks and in the Plane
- Voronoi game on graphs
- Covering Problems
- The \(p\) maximal cover -- \(p\) partial center problem on networks
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
- Perception and information in a competitive location model
- Optimal location of remote dental units
- An iterated local search for the budget constrained generalized maximal covering location problem
- Maximum coverage problem with group budget constraints
- Sequential location problems
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs
- \((r,p)\)-centroid problems on paths and trees
- Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods
- Improved complexity bounds for location problems on the real line
- A survey on optimization studies of group centrality metrics
- The variable radius covering problem
- A dual bounding scheme for a territory design problem
- Facility reallocation on the line
- On the complexity of the upgrading version of the maximal covering location problem
- New algorithms for facility location problems on the real line
- Online budgeted maximum coverage
- An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
- Benders decomposition for very large scale partial set covering and maximal covering location problems
This page was built for publication: The Maximum Coverage Location Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3661269)
