Artículo
A discretizing algorithm for location problems
Autor/es | Carrizosa Priego, Emilio José
Puerto Gómez, Justo |
Departamento | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa |
Fecha de publicación | 1995 |
Fecha de depósito | 2021-04-20 |
Publicado en |
|
Resumen | A new and simple methodology is proposed to solve both constrained and unconstrained planar
continuous single-facility location problems. As particular instances, the classical location problems with
mixed gauges can be ... A new and simple methodology is proposed to solve both constrained and unconstrained planar continuous single-facility location problems. As particular instances, the classical location problems with mixed gauges can be solved. Theoretical convergence is proved, and numerical examples are given, showing a fast convergence in a small number of steps. |
Cita | Carrizosa Priego, E.J. y Puerto Gómez, J. (1995). A discretizing algorithm for location problems. European Journal of Operational Research, 80 (1), 166-174. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
A DISCRETIZING ALGORITHM FOR ... | 569.6Kb | [PDF] | Ver/ | |