IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v110y2002i1p33-5310.1023-a1020707315345.html
   My bibliography  Save this article

Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives

Author

Listed:
  • Horst Hamacher
  • Martine Labbé
  • Stefan Nickel
  • Anders Skriver

Abstract

Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are both desirable and undesirable at the same time, e.g., an airport. This can be modeled as a multicriteria network location problem, where some of the sum-objectives are maximized (push effect) and some of the sum-objectives are minimized (pull effect). We present a polynomial time algorithm for this model along with some basic theoretical results, and generalize the results also to incorporate maximin and minimax objectives. In fact, the method works for any piecewise linear objective functions. Finally, we present some computational results. Copyright Kluwer Academic Publishers 2002

Suggested Citation

  • Horst Hamacher & Martine Labbé & Stefan Nickel & Anders Skriver, 2002. "Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives," Annals of Operations Research, Springer, vol. 110(1), pages 33-53, February.
    • Handle: RePEc:spr:annopr:v:110:y:2002:i:1:p:33-53:10.1023/a:1020707315345
    DOI: 10.1023/A:1020707315345
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1020707315345
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1020707315345?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Heydari, Ruhollah & Melachrinoudis, Emanuel, 2012. "Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives," European Journal of Operational Research, Elsevier, vol. 223(2), pages 452-460.
    2. Kalcsics, Jörg & Nickel, Stefan & Pozo, Miguel A. & Puerto, Justo & Rodríguez-Chía, Antonio M., 2014. "The multicriteria p-facility median location problem on networks," European Journal of Operational Research, Elsevier, vol. 235(3), pages 484-493.
    3. Farahani, Reza Zanjirani & Fallah, Samira & Ruiz, Rubén & Hosseini, Sara & Asgari, Nasrin, 2019. "OR models in urban service facility location: A critical review of applications and future developments," European Journal of Operational Research, Elsevier, vol. 276(1), pages 1-27.

    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:annopr:v:110:y:2002:i:1:p:33-53:10.1023/a:1020707315345. 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.