IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v22y2011i1d10.1007_s10878-009-9272-3.html
   My bibliography  Save this article

Line facility location in weighted regions

Author

Listed:
  • Yam Ki Cheung

    (University of Texas at Dallas)

  • Ovidiu Daescu

    (University of Texas at Dallas)

Abstract

In this paper, we present approximation algorithms for solving the line facility location problem in weighted regions. The weighted region setup is a more realistic model for many facility location problems that arise in practical applications. Our algorithms exploit an interesting property of the problem, that could possibly be used for solving other problems in weighted regions.

Suggested Citation

  • Yam Ki Cheung & Ovidiu Daescu, 2011. "Line facility location in weighted regions," Journal of Combinatorial Optimization, Springer, vol. 22(1), pages 52-70, July.
    • Handle: RePEc:spr:jcomop:v:22:y:2011:i:1:d:10.1007_s10878-009-9272-3
    DOI: 10.1007/s10878-009-9272-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-009-9272-3
    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-009-9272-3?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.

    References listed on IDEAS

    as
    1. Danny Z. Chen & Xiaobo (Sharon) Hu & Jinhui Xu, 2003. "Computing Optimal Beams in Two and Three Dimensions," Journal of Combinatorial Optimization, Springer, vol. 7(2), pages 111-136, June.
    2. GOEMANS, Michel X. & SKUTELLA, Martin, 2000. "Cooperative facility location games," LIDAM Discussion Papers CORE 2000014, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Danny Z. Chen & Ovidiu Daescu & Xiaobo (Sharon) Hu & Xiaodong Wu & Jinhui Xu, 2001. "Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions," Journal of Combinatorial Optimization, Springer, vol. 5(1), pages 59-79, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Danny Z. Chen & Ovidiu Daescu & Yang Dai & Naoki Katoh & Xiaodong Wu & Jinhui Xu, 2005. "Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications," Journal of Combinatorial Optimization, Springer, vol. 9(1), pages 69-90, February.
    2. Lindong Liu & Yuqian Zhou & Zikang Li, 2022. "Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(1), pages 81-99, February.
    3. Haimanko, Ori & Le Breton, Michel & Weber, Shlomo, 2004. "Voluntary formation of communities for the provision of public projects," Journal of Economic Theory, Elsevier, vol. 115(1), pages 1-34, March.
    4. Qizhi Fang & Hye Kyung Kim, 2005. "A Note on Balancedness of Dominating Set Games," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 303-310, December.
    5. Azadeh Tabatabaei & Mohammad Ghodsi, 2015. "Walking in streets with minimal sensing," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 387-401, August.
    6. Lindong Liu & Xiangtong Qi & Zhou Xu, 2016. "Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 687-702, November.
    7. Adam N. Elmachtoub & Retsef Levi, 2016. "Supply Chain Management with Online Customer Selection," Operations Research, INFORMS, vol. 64(2), pages 458-473, April.

    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:22:y:2011:i:1:d:10.1007_s10878-009-9272-3. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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.