Advanced Search
MyIDEAS: Login

Improved Approximation of the General Soft-Capacitated Facility Location Problem

Contents:

Author Info

Registered author(s):

    Abstract

    An NP-hard variant of the single-source Capacitated Facility Location Problem is studied, where each facility is composed of a variable number of fixed-capacity production units. This problem, especially the metric case, has been recently studied in several papers. In this paper, we only consider the general problem where connection costs do not systematically satisfy the triangle inequality property. We show that an adaptation of the set covering greedy heuristic, where the sub-problem is approximately solved by a Fully Polynomial-Time Approximation Scheme based on cost scaling and dynamic programming, achieves a logarithmic approximation ratio of (1+ƒÕ)H(n) for the problem, where n is the number of clients to be served, and H is the harmonic series. This improves the previous bound of 2H(n) for this problem.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.essec.fr/faculty/showDeclFileRes.do?declId=3996&key=__workpaper__
    Download Restriction: no

    Bibliographic Info

    Paper provided by ESSEC Research Center, ESSEC Business School in its series ESSEC Working Papers with number DR 05003.

    as in new window
    Length: 17 pages
    Date of creation: Mar 2005
    Date of revision:
    Handle: RePEc:ebg:essewp:dr-05003

    Contact details of provider:
    Postal: ESSEC Research Center, BP 105, 95021 Cergy, France
    Email:
    Web page: http://www.essec.edu/
    More information through EDIRC

    Related research

    Keywords: Facility Location; Combinatorial optimization; Set Covering; Dynamic Programming; Approximation;

    Find related papers by JEL classification:

    This paper has been announced in the following NEP Reports:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:ebg:essewp:dr-05003. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sophie Magnanou).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.