Article

 dc.creator Carrizosa Priego, Emilio José es dc.creator Plastria, Frank es dc.date.accessioned 2021-04-26T08:02:43Z dc.date.available 2021-04-26T08:02:43Z dc.date.issued 1998-12-01 dc.identifier.citation Carrizosa Priego, E.J. y Plastria, F. (1998). Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints. TOP, 6 (2), 179-194. dc.identifier.issn 1134-5764 es dc.identifier.issn 1863-8279 es dc.identifier.uri https://hdl.handle.net/11441/107710 dc.description.abstract A location is sought within some convex region of the plane for the central site of some public service to a finite number of demand points. The parametric maxcovering problem consists in finding for eachR>0 the point from which the total weight of the demand points within distanceR is maximal. The parametric minimal quantile problem asks for each percentage α the point minimising the distance necessary for covering demand points of total weight at least α. We investigate the properties of these two closely related problems and derive polynomial algorithms to solve them both in case of either (possibly inflated) Euclidean or polyhedral distances. es dc.format application/pdf es dc.format.extent 15 p. es dc.language.iso eng es dc.publisher Springer es dc.relation.ispartof TOP, 6 (2), 179-194. dc.rights Attribution-NonCommercial-NoDerivatives 4.0 Internacional * dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/4.0/ * dc.subject maximal covering es dc.subject minimal quantile es dc.subject single facility location es dc.subject Euclidean distance es dc.subject polyhedral distance es dc.subject sensitivity analysis es dc.title Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints es dc.type info:eu-repo/semantics/article es dc.type.version info:eu-repo/semantics/publishedVersion es dc.rights.accessrights info:eu-repo/semantics/openAccess es dc.contributor.affiliation Universidad de Sevilla. Departamento de Estadística e Investigación Operativa es dc.relation.publisherversion http://doi.org/10.1007/bf02564786 es dc.identifier.doi 10.1007/bf02564786 es dc.contributor.group Universidad de Sevilla. FQM329: Optimización es dc.journaltitle TOP es dc.publication.volumen 6 es dc.publication.issue 2 es dc.publication.initialPage 179 es dc.publication.endPage 194 es
﻿
FilesSizeFormatViewDescription
Polynomial algorithms for ...601.3Kb   [PDF] View/Open

This item appears in the following collection(s)

Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional