DocumentCode
1934691
Title
Notice of Retraction
Approximation algorithm for the k- product uncapacitated facility location problem
Author
Bin Yi ; Rongheng Li
Author_Institution
Hunan Vocational Coll. of Railway Technol., Zhuzhou, China
Volume
5
fYear
2010
fDate
9-11 July 2010
Firstpage
602
Lastpage
605
Abstract
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
We consider one kind of uncapacitated facility location problem which we call k-product uncapacitated facility location problem with no-fixed costs(k-PUFLPN). The problem can be defined as follows: There is a set of demand points where clients are located and a set of potential sites where facilities of unlimited capacities can be set up. There are k different kinds of products. Each client needs to be supplied with k kinds of products by a set of k different facilities and each facility can be set up to supply only a distinct product with no fixed cost. There is a non-negative cost of shipping goods between each pair of locations. These costs are assumed to be symmetric and satisfy the triangle inequality. We want to select a set of facilities to be opened and their designated products and to find an assignment for each client to a set of k facilities so as to minimize the sum of the shipping costs. In this paper, we propose an approximation algorithm with a performance guarantee of (3/2) k -1 for the k-PUFLPN.
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
We consider one kind of uncapacitated facility location problem which we call k-product uncapacitated facility location problem with no-fixed costs(k-PUFLPN). The problem can be defined as follows: There is a set of demand points where clients are located and a set of potential sites where facilities of unlimited capacities can be set up. There are k different kinds of products. Each client needs to be supplied with k kinds of products by a set of k different facilities and each facility can be set up to supply only a distinct product with no fixed cost. There is a non-negative cost of shipping goods between each pair of locations. These costs are assumed to be symmetric and satisfy the triangle inequality. We want to select a set of facilities to be opened and their designated products and to find an assignment for each client to a set of k facilities so as to minimize the sum of the shipping costs. In this paper, we propose an approximation algorithm with a performance guarantee of (3/2) k -1 for the k-PUFLPN.
Keywords
approximation theory; cost reduction; facility location; goods distribution; supply and demand; approximation algorithm; cost assumption; demand points; goods shipping; k- product uncapacitated facility location problem; nonnegative cost; product supply; shipping costs; triangle inequality; Approximation algorithm; Facility location; k-product;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-5537-9
Type
conf
DOI
10.1109/ICCSIT.2010.5563849
Filename
5563849
Link To Document