The Uncapacitated Facility Location Problem with Client Matching (LCM) is an extension of the Uncapacitated Facility Location Problem (UFLP), where two clients allocated to a facility can be matched. As in the UFLP, facilities can be opened at any of m predefined locatio...
This note presents an alternative formulation of the deterministic location model which Tcha and Yoon have recently developed to approximate the stochastic uncapacitated facility location problem. The model, besides being more compact and easier to handle than their model, has the distinct advantage of ...
We present a 1.488-approximation algorithm for the metric uncapacitated facility location (UFL) problem. Previously, the best algorithm was due to Byrka (2007). Byrka proposed an algorithm parametrized by γ and used it with . By either running his algorithm or the algorithm proposed by Jain, ...
In this paper, we simultaneously study the uncapacitated fixed-charge location problem (UFLP) and a multi-echelon inventory problem. We initially develop an approximate integer programming formulation for the inventory problem. The later problem is combined with the UFLP and the integrated model is ...
Summary: The classical 1962 Benders decomposition scheme is a traditional approach for solving mixed-integer problems such as the uncapacitated facility location problem. Subsequent research has been focused on finding better cutting-plane generation schemes to reduce the solution process time. Pareto-optim...
We studied the Fault-Tolerant Facility Placement problem (FTFP) which generalizes the uncapacitated facility location problem (UFL). In FTFP, we are given a set F of sites at which facilities can be built, and a set C of clients with some demands that need to be satisfied by different ...
In this paper we consider two medi-centre location problems. One is the m-medi-centre problem in which we add to the m-median problem uniform distance constraints. The other problem is the uncapacitated medi-centre facility location problem where we include the fixed costs of establishing the ...
Neighbourhood Search Heuristics for the Uncapacitated Facility Location Problem 来自 115.111.81.83:8080 喜欢 0 阅读量: 48 作者: D Ghosh 摘要: European Journal of Operational Research Vol. 150, No. 1,(2003), pp. 150-162 被引量: 6 年份: 2003 ...
The TPP also reduces to the uncapacitated facility location problem (UFLP) if cij is equal to the average opening cost of locations i and j, and pki is the cost of serving customer k from facility i. The UTPP can also be transformed into a generalized traveling salesman problem (GTSP)....
A 1.488 approximation algorithm for the uncapacitated facility location problem Inf. Comput. (2013) R. Miao et al. A note on LP-based approximation algorithms for capacitated facility location problem Theor. Comput. Sci. (2022) D. Xu et al. The k-level facility location game Oper. Res. Let...