.png){kind=icon}
Return
The big cube small cube solution method for multidimensional facility location problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2009.03.031.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we propose a general solution method for (non-differentiable) facility location problems with more than two variables as an extension of the Big Square Small Square technique (BSSS). We develop a general framework based on lower bounds and discarding tests for every location problem. We demonstrate our approach on three problems: the Fermat-Weber problem with positive and negative weights, the median circle problem, and the p-median problem. For each of these problems we show how to calculate lower bounds and discarding tests. Computational experiences are given which show that the proposed solution method is fast and exact. (C) 2009 Elsevier Ltd. All rights reserved.
Keywords:
Approximation algorithms
Facility location problem
p-median problem
Fermat-Weber problem
Continuous location
Global optimization
Non-differentiable optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more