IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v38y2019i2d10.1007_s10878-019-00404-2.html
   My bibliography  Save this article

Approximation algorithm for squared metric two-stage stochastic facility location problem

Author

Listed:
  • Jin Zhang

    (Beijing University of Technology
    Beijing Municipal Institute of Labour Protection)

  • Min Li

    (Shandong Normal University)

  • Yishui Wang

    (Chinese Academy of Sciences)

  • Chenchen Wu

    (Tianjin University of Technology)

  • Dachuan Xu

    (Beijing University of Technology)

Abstract

In this paper, we consider a variant of the classical uncapacitated facility location problem, so-called squared metric two-stage stochastic facility location problem (SM-2-SFLP) which can treat the uncertainty of the set of clients and facility costs. We assume that the connection cost is squared metric, a variant of the metric case which is widely researched. We give a new 0–1 integer linear programming for SM-2-SFLP. Based on the new formulation, we apply two known algorithms to SM-2-SFLP, and analyze the approximation ratio and per-scenario bound respectively.

Suggested Citation

  • Jin Zhang & Min Li & Yishui Wang & Chenchen Wu & Dachuan Xu, 2019. "Approximation algorithm for squared metric two-stage stochastic facility location problem," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 618-634, August.
    • Handle: RePEc:spr:jcomop:v:38:y:2019:i:2:d:10.1007_s10878-019-00404-2
    DOI: 10.1007/s10878-019-00404-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00404-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-019-00404-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:38:y:2019:i:2:d:10.1007_s10878-019-00404-2. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.