By Topic

Notice of Retraction
Approximation algorithm for the k- product uncapacitated facility location problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bin Yi ; Hunan Vocational Coll. of Railway Technol., Zhuzhou, China ; Rongheng Li

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

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.

Published in:

Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on  (Volume:5 )

Date of Conference:

9-11 July 2010