Note—On a Modified One-Center Model

Cited in

(27)

The variable radius covering problem
On a circle placement problem
The p-cover problem
A single facility location problem with a weighted maximin-minimax rectilinear distance
The slab dividing approach to solve the Euclidean \(P\)-center problem
Sequential location problems
Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
The \(p\) maximal cover -- \(p\) partial center problem on networks
The gradual covering decay location problem on a network.
Territorial design optimization for business sales plan
Near-linear time approximation schemes for geometric maximum coverage
On the conditional \(p\)-median problem
Covering problems with polyellipsoids: a location analysis perspective
New exact algorithms for planar maximum covering location by ellipses problems
The most points connected-covering problem with two disks
Finding a cluster of points and the grey pattern quadratic assignment problem
On planar medianoid competitive location problems with Manhattan distance
Covering part of a planar network
Linear Time Approximation Schemes for Geometric Maximum Coverage
An iterated local search for the budget constrained generalized maximal covering location problem
Static competitive facility location: an overview of optimisation approaches.
Competitive location models: a review
Competitive location in the plane
Covering many or few points with unit disks
Covering point sets with two disjoint disks or squares
Generalized coverage: new developments in covering location models
On competitive sequential location in a network with a decreasing demand intensity

This page was built for publication: Note—On a Modified One-Center Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3912328)