Fractional location problems
In this paper we analyze some variants of the classical uncapacitated facility location problem with a ratio as an objective function. Using basic concepts and results of fractional programming, we identify a class of one-level fractional location problems which can be solved in polynomial time in terms of the size of the problem. We also consider the fractional two-echelon location problem, which is a special case of the general two-level fractional location problem. For this two-level fractional location problem we identify cases for which its solution involves decomposing the problem into several one-level fractional location problems.
|Keywords||discrete location, fractional program|
|Persistent URL||dx.doi.org/10.1016/S0966-8349(97)00011-9, hdl.handle.net/1765/11651|
Barros, A.I., Frenk, J.B.G., & Gromicho, J.A.S.. (1997). Fractional location problems. Location Science, 5(1), 47–58. doi:10.1016/S0966-8349(97)00011-9