IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v136y2025ics0305048325000453.html
   My bibliography  Save this article

Sparse facility location and network design problems

Author

Listed:
  • Li, Gao-Xi
  • Ren, Yi
  • Yi, Peiru

Abstract

To further minimize the number of facilities even if it entails additional costs, policymakers often have this preference during facility location decisions. To cater to this preference, we introduce a sparsity-inducing term in this paper. This term generates sparse solutions for both the facility location model and the facility network design model, leading to the proposal of a sparse facility location model and a sparse facility network design model. These two sparse models are formulated as nonlinear mixed-integer programs, featuring objective functions that are non-Lipschitz continuous concerning continuous variables, making them highly challenging to solve. Consequently, we propose a continuous relaxation approach that converts these sparse discrete models into continuous nonlinear programs. We validate the efficacy of both the sparse discrete models and the relaxation method through two classic case studies.

Suggested Citation

  • Li, Gao-Xi & Ren, Yi & Yi, Peiru, 2025. "Sparse facility location and network design problems," Omega, Elsevier, vol. 136(C).
  • Handle: RePEc:eee:jomega:v:136:y:2025:i:c:s0305048325000453
    DOI: 10.1016/j.omega.2025.103319
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048325000453
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.omega.2025.103319?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:eee:jomega:v:136:y:2025:i:c:s0305048325000453. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.