A global optimization procedure for the location of a median line in the three-dimensional space

A global optimization procedure is proposed to find a line in the Euclidean three-dimensional space which minimizes the sum of distances to a given finite set of three-dimensional data points. Although we are using similar techniques as for location problems in two dimensions, it is shown that the p...

Descripción completa

Detalles Bibliográficos
Autores: Blanquero Bravo, Rafael, Carrizosa Priego, Emilio José, Schöbel, Anita, Scholz, Daniel
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2011
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/107475
Acceso en línea:https://hdl.handle.net/11441/107475
https://doi.org/10.1016/j.ejor.2011.05.030
Access Level:acceso abierto
Palabra clave:Geometric branch-and-bound methods
Global optimization
Line location
id ES_4fb5be54cb1be7c0e00cbb5379d76d4f
oai_identifier_str oai:idus.us.es:11441/107475
network_acronym_str ES
network_name_str España
repository_id_str
spelling A global optimization procedure for the location of a median line in the three-dimensional spaceBlanquero Bravo, RafaelCarrizosa Priego, Emilio JoséSchöbel, AnitaScholz, DanielGeometric branch-and-bound methodsGlobal optimizationLine locationA global optimization procedure is proposed to find a line in the Euclidean three-dimensional space which minimizes the sum of distances to a given finite set of three-dimensional data points. Although we are using similar techniques as for location problems in two dimensions, it is shown that the problem becomes much harder to solve. However, a problem parameterization as well as lower bounds are suggested whereby we succeeded in solving medium-size instances in a reasonable amount of computing time.ELSEVIER SCIENCE BVEstadística e Investigación OperativaFQM329: Optimización2011info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/107475https://doi.org/10.1016/j.ejor.2011.05.030reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésEuropean Journal of Operational Research, 215 (1), 14-20.http://doi.org/10.1016/j.ejor.2011.05.030info:eu-repo/semantics/openAccessoai:idus.us.es:11441/1074752026-06-17T12:51:07Z
dc.title.none.fl_str_mv A global optimization procedure for the location of a median line in the three-dimensional space
title A global optimization procedure for the location of a median line in the three-dimensional space
spellingShingle A global optimization procedure for the location of a median line in the three-dimensional space
Blanquero Bravo, Rafael
Geometric branch-and-bound methods
Global optimization
Line location
title_short A global optimization procedure for the location of a median line in the three-dimensional space
title_full A global optimization procedure for the location of a median line in the three-dimensional space
title_fullStr A global optimization procedure for the location of a median line in the three-dimensional space
title_full_unstemmed A global optimization procedure for the location of a median line in the three-dimensional space
title_sort A global optimization procedure for the location of a median line in the three-dimensional space
dc.creator.none.fl_str_mv Blanquero Bravo, Rafael
Carrizosa Priego, Emilio José
Schöbel, Anita
Scholz, Daniel
author Blanquero Bravo, Rafael
author_facet Blanquero Bravo, Rafael
Carrizosa Priego, Emilio José
Schöbel, Anita
Scholz, Daniel
author_role author
author2 Carrizosa Priego, Emilio José
Schöbel, Anita
Scholz, Daniel
author2_role author
author
author
dc.contributor.none.fl_str_mv Estadística e Investigación Operativa
FQM329: Optimización
dc.subject.none.fl_str_mv Geometric branch-and-bound methods
Global optimization
Line location
topic Geometric branch-and-bound methods
Global optimization
Line location
description A global optimization procedure is proposed to find a line in the Euclidean three-dimensional space which minimizes the sum of distances to a given finite set of three-dimensional data points. Although we are using similar techniques as for location problems in two dimensions, it is shown that the problem becomes much harder to solve. However, a problem parameterization as well as lower bounds are suggested whereby we succeeded in solving medium-size instances in a reasonable amount of computing time.
publishDate 2011
dc.date.none.fl_str_mv 2011
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/107475
https://doi.org/10.1016/j.ejor.2011.05.030
url https://hdl.handle.net/11441/107475
https://doi.org/10.1016/j.ejor.2011.05.030
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv European Journal of Operational Research, 215 (1), 14-20.
http://doi.org/10.1016/j.ejor.2011.05.030
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_ 1869407836712206336
score 15,301603

Similares en LA Referencia