Locating a semi-obnoxious covering facility with repelling polygonal regions

A facility is to be located in the Euclidean plane to serve certain sites by covering them closely. Simultaneously, a set of polygonal areas must be protected from the negative effects from that facility. The problem is formulated as a margin maximization model. Necessary optimality conditions are s...

Descripción completa

Detalles Bibliográficos
Autores: Plastria, Frank, Gordillo, José, Carrizosa Priego, Emilio José
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2013
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/107732
Acceso en línea:https://hdl.handle.net/11441/107732
https://doi.org/10.1016/j.dam.2013.05.010
Access Level:acceso abierto
Palabra clave:Continuous location
Push–pull
Semi-obnoxious facility
Covering
Euclidean distance
Margin maximization
id ES_b2c2273b3611febbdf8b7a980148c021
oai_identifier_str oai:idus.us.es:11441/107732
network_acronym_str ES
network_name_str España
repository_id_str
spelling Locating a semi-obnoxious covering facility with repelling polygonal regionsPlastria, FrankGordillo, JoséCarrizosa Priego, Emilio JoséContinuous locationPush–pullSemi-obnoxious facilityCoveringEuclidean distanceMargin maximizationA facility is to be located in the Euclidean plane to serve certain sites by covering them closely. Simultaneously, a set of polygonal areas must be protected from the negative effects from that facility. The problem is formulated as a margin maximization model. Necessary optimality conditions are studied and a finite dominating set of solutions is obtained, leading to a polynomial algorithm. The method is illustrated on some examples.ELSEVIER SCIENCE BVEstadística e Investigación OperativaFQM329: Optimización2013info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/107732https://doi.org/10.1016/j.dam.2013.05.010reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésDiscrete Applied Mathematics, 161 (16-17), 2604-2623.http://doi.org/10.1016/j.dam.2013.05.010info:eu-repo/semantics/openAccessoai:idus.us.es:11441/1077322026-06-17T12:51:07Z
dc.title.none.fl_str_mv Locating a semi-obnoxious covering facility with repelling polygonal regions
title Locating a semi-obnoxious covering facility with repelling polygonal regions
spellingShingle Locating a semi-obnoxious covering facility with repelling polygonal regions
Plastria, Frank
Continuous location
Push–pull
Semi-obnoxious facility
Covering
Euclidean distance
Margin maximization
title_short Locating a semi-obnoxious covering facility with repelling polygonal regions
title_full Locating a semi-obnoxious covering facility with repelling polygonal regions
title_fullStr Locating a semi-obnoxious covering facility with repelling polygonal regions
title_full_unstemmed Locating a semi-obnoxious covering facility with repelling polygonal regions
title_sort Locating a semi-obnoxious covering facility with repelling polygonal regions
dc.creator.none.fl_str_mv Plastria, Frank
Gordillo, José
Carrizosa Priego, Emilio José
author Plastria, Frank
author_facet Plastria, Frank
Gordillo, José
Carrizosa Priego, Emilio José
author_role author
author2 Gordillo, José
Carrizosa Priego, Emilio José
author2_role author
author
dc.contributor.none.fl_str_mv Estadística e Investigación Operativa
FQM329: Optimización
dc.subject.none.fl_str_mv Continuous location
Push–pull
Semi-obnoxious facility
Covering
Euclidean distance
Margin maximization
topic Continuous location
Push–pull
Semi-obnoxious facility
Covering
Euclidean distance
Margin maximization
description A facility is to be located in the Euclidean plane to serve certain sites by covering them closely. Simultaneously, a set of polygonal areas must be protected from the negative effects from that facility. The problem is formulated as a margin maximization model. Necessary optimality conditions are studied and a finite dominating set of solutions is obtained, leading to a polynomial algorithm. The method is illustrated on some examples.
publishDate 2013
dc.date.none.fl_str_mv 2013
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/107732
https://doi.org/10.1016/j.dam.2013.05.010
url https://hdl.handle.net/11441/107732
https://doi.org/10.1016/j.dam.2013.05.010
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Discrete Applied Mathematics, 161 (16-17), 2604-2623.
http://doi.org/10.1016/j.dam.2013.05.010
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv ELSEVIER SCIENCE BV
publisher.none.fl_str_mv ELSEVIER SCIENCE BV
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869417081984778240
score 15,300724

Similares en LA Referencia