Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
From MaRDI portal
Publication:1284596
DOI10.1007/BF02564786zbMath0916.90188OpenAlexW1985270229WikidataQ74822818 ScholiaQ74822818MaRDI QIDQ1284596
Emilio Carrizosa, Frank Plastria
Publication date: 26 April 1999
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02564786
sensitivity analysisEuclidean distancemaximal coveringconvex regionsingle facility locationpublic serviceminimal quantileparametric max-covering problemparametric minimal quantile problempolyhedral distance
Related Items (10)
A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks ⋮ On minquantile and maxcovering optimisation ⋮ A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover ⋮ Solving the 1-median problem on a network with continuous demand and demand surplus ⋮ Euclidean push--pull partial covering problems ⋮ A defensive maximal covering problem on a network ⋮ The β-reliable minimax and maximin location problems on a network with probabilistic weights ⋮ Undesirable facility location with minimal covering objectives ⋮ Low complexity algorithms for optimal consumer push-pull partial covering in the plane ⋮ The variable radius covering problem
Cites Work
- On the uniqueness of optimal solutions in continuous location theory
- Geometrical properties of the Fermat-Weber problem
- On a circle placement problem
- On minquantile and maxcovering optimisation
- Note—On a Modified One-Center Model
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- A note describing the marginal benefits of spares on availability
This page was built for publication: Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
