IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/971.html
   My bibliography  Save this paper

Sensitivity analysis in minisum facility location problems

Author

Listed:
  • LABBE, Martine
  • THISSE, Jacques-François
  • WENDELL, Richard E.

Abstract

This paper considers tradeoffs between cost and perturbations of the weights in a single facility, minisum location problem over a finite set of feasible points. Specifically, the paper characterizes a tradeoff curve of variability in the weights versus the degree of optimality of a solution. The general theoretical framework includes problems of location on a tree network and location using block norms; special results are given for these cases.
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • LABBE, Martine & THISSE, Jacques-François & WENDELL, Richard E., 1991. "Sensitivity analysis in minisum facility location problems," LIDAM Reprints CORE 971, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:971
    DOI: 10.1287/opre.39.6.961
    Note: In : Operations Research, 39(6), 961-969, 1991
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    Citations

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


    Cited by:

    1. Igor Averbakh & Oded Berman, 2000. "Minmax Regret Median Location on a Network Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 104-110, May.
    2. George L. Vairaktarakis & Panagiotis Kouvelis, 1999. "Incorporation dynamic aspects and uncertainty in 1‐median location problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(2), pages 147-168, March.
    3. Averbakh, Igor & Berman, Oded, 2000. "Algorithms for the robust 1-center problem on a tree," European Journal of Operational Research, Elsevier, vol. 123(2), pages 292-302, June.
    4. Igor Averbakh, 2005. "The Minmax Relative Regret Median Problem on Networks," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 451-461, November.
    5. Soumen Kumar Das & Sankar Kumar Roy & Gerhard Wilhelm Weber, 2020. "Heuristic approaches for solid transportation-p-facility location problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(3), pages 939-961, September.
    6. Owen, Susan Hesse & Daskin, Mark S., 1998. "Strategic facility location: A review," European Journal of Operational Research, Elsevier, vol. 111(3), pages 423-447, December.

    More about this item

    Statistics

    Access and download statistics

    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:cor:louvrp:971. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    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.