On the complexity of the upgrading version of the maximal covering location problem

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

On covering location problems on networks with edge demand
Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
Upgrading $p$-median problem on a path
Up- and downgrading the 1-center in a network
Improved complexity bounds for location problems on the real line
On the flow cost lowering problem
Upgrading nodes in tree-shaped hub location
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
Upgrading the 1-center problem with edge length variables on a tree
Extensive facility location problems on networks: an updated review
Upgrading min-max spanning tree problem under various cost functions
Benders decomposition for very large scale partial set covering and maximal covering location problems
Multi-period stochastic covering location problems: modeling framework and solution approach
Uniform and most uniform partitions of trees
Maximum shortest path interdiction problem by upgrading edges on trees under weighted $l_1$ norm
Continuous facility location on graphs
Optimal approaches for upgrading selective obnoxious $p$-median location problems on tree networks
The accessibility arc upgrading problem
New variations of the maximum coverage facility location problem
On the fuzzy maximal covering location problem
An $O(pn^ 2)$ algorithm for the $p$-median and related problems on tree graphs
Minmax regret maximal covering location problems with edge demands
Continuous maximal covering location problems with interconnected facilities
Upgrading edges in the maximal covering location problem
The Maximum Coverage Location Problem
The budgeted minimum cost flow problem with unit upgrading cost
Network upgrading problems
Optimal algorithms for selective variants of the classical and inverse median location problems on trees
Upgrading arcs to minimize the maximum travel time in a network
Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees
Upgrading edges in the graphical TSP
The $p$-median problem with upgrading of transportation costs and minimum travel time allocation
Minimum cost flow problem with conflicts
On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows
Efficient algorithms for finding <scp>2‐medians</scp> of a tree
A novel pseudo‐polynomial approach for shortest path problems
Covering edges in networks
The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction

This page was built for publication: On the complexity of the upgrading version of the maximal covering location problem