In this paper, we propose and analyze a local search algorithm for the capacitated facility location problem. Our algorithm is a modification of the algorithm proposed by Zhang et al. [7] and improves the approximation ratio from 5.83 to 5. We achieve this by modifying the close, open and multi operations. The idea of taking linear combinations of inequalities used in Aggarwal et al [1] is crucial in achieving this result. The example proposed by Zhang et al. also shows that our analysis is tight
We consider the facility location problem where each facility can serve at most U clients. We analyz...
In this research, we will focus on one variant of the problem: the capacitated facility location pro...
We study local search algorithms for metric instances of facility location problems: the uncapacitat...
In this paper, we propose and analyze a local search algorithm for the capacitated facility location...
In this paper, we propose and analyze a local search algorithm for the Universal facility location p...
There has been a great deal of recent work on approximation algorithms for fa-cility location proble...
We present a multi-exchange local search algorithm for approximating the capacitated facility locati...
We present a multiexchange local search algorithm for approximating the capacitated facility locatio...
We present a multi-exchange local search algorithm for approximating the capacitated facility locati...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
We study the capacitated k-facility location problem, in which we are given a set of clients with de...
AbstractThe k-facility location problem is a common generalization of the facility location and the ...
A new methodology to solve the capacitated facility location problem (CFLP) is presented. This optim...
In this paper, we study approximation algorithms for several NP-hard facility location problems. We ...
We give a modified version of a heuristic, available in the relevant literature, of the capacitated ...
We consider the facility location problem where each facility can serve at most U clients. We analyz...
In this research, we will focus on one variant of the problem: the capacitated facility location pro...
We study local search algorithms for metric instances of facility location problems: the uncapacitat...
In this paper, we propose and analyze a local search algorithm for the capacitated facility location...
In this paper, we propose and analyze a local search algorithm for the Universal facility location p...
There has been a great deal of recent work on approximation algorithms for fa-cility location proble...
We present a multi-exchange local search algorithm for approximating the capacitated facility locati...
We present a multiexchange local search algorithm for approximating the capacitated facility locatio...
We present a multi-exchange local search algorithm for approximating the capacitated facility locati...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
We study the capacitated k-facility location problem, in which we are given a set of clients with de...
AbstractThe k-facility location problem is a common generalization of the facility location and the ...
A new methodology to solve the capacitated facility location problem (CFLP) is presented. This optim...
In this paper, we study approximation algorithms for several NP-hard facility location problems. We ...
We give a modified version of a heuristic, available in the relevant literature, of the capacitated ...
We consider the facility location problem where each facility can serve at most U clients. We analyz...
In this research, we will focus on one variant of the problem: the capacitated facility location pro...
We study local search algorithms for metric instances of facility location problems: the uncapacitat...