Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints (Q1284596)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints |
scientific article; zbMATH DE number 1279003
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints |
scientific article; zbMATH DE number 1279003 |
Statements
Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints (English)
0 references
26 April 1999
0 references
maximal covering
0 references
minimal quantile
0 references
single facility location
0 references
Euclidean distance
0 references
polyhedral distance
0 references
sensitivity analysis
0 references
convex region
0 references
public service
0 references
parametric max-covering problem
0 references
parametric minimal quantile problem
0 references
0.89521915
0 references
0.87209857
0 references
0.8708925
0 references
0.87058115
0 references
0.86782527
0 references
0.8653736
0 references
0.8641548
0 references
0.86379206
0 references
