dc.creatorCornejo Zúñiga, Oscar
dc.creatorMichelot, Cristian
dc.date2015-11-06T17:23:17Z
dc.date2015-11-06T17:23:17Z
dc.date2005
dc.identifierComputational Science and Its Applications – ICCSA 2005
dc.identifier9783540323099
dc.identifierhttp://repositoriodigital.ucsc.cl/handle/25022009/247
dc.descriptionWe propose a proximal approach for solving a wide class of minimax location problems which in particular contains the round trip location problem. We show that a suitable reformulation of the problem allows to construct a Fenchel duality scheme the primal-dual optimality conditions of which can be solved by a proximal algorithm. This approach permits to solve problems for which distances are measured by mixed norms or gauges and to handle a large variety of convex constraints. Several numerical results are presented.
dc.languageen
dc.publisherSpringer
dc.rightsAtribucion-Nocomercial-SinDerivadas 3.0 Chile
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/
dc.sourcehttp://goo.gl/jRupU5
dc.subjectContinuous location
dc.subjectMinimax location
dc.subjectround-trip location problem
dc.subjectProximal method
dc.subjectFenchel duality
dc.subjectPatrial inverse method
dc.titleA proximal solution for a class of extended minimax location problem
dc.typeArticle


Este ítem pertenece a la siguiente institución