IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v30y1982i4p725-744.html
   My bibliography  Save this article

Duality and Distance Constraints for the Nonlinear p -Center Problem and Covering Problem on a Tree Network

Author

Listed:
  • B. C. Tansel

    (Georgia Institute of Technology, Atlanta, Georgia)

  • R. L. Francis

    (The University of Florida, Gainesville, Florida)

  • T. J. Lowe

    (Purdue University, West Lafayette, Indiana)

  • M. L. Chen

    (The University of Florida, Gainesville, Florida)

Abstract

The problem of locating a fixed number, p , of facilities (centers) on a network, where there are constraints on the center locations and where the centers provide a service to customers (demand points) located at vertices of the network is addressed. The cost or “loss” of servicing a given demand point is a nonlinear function of the distance between the demand point and the closest center. We consider the case where the network has special structure (a tree network), i.e., there is a unique shortest path between any two points on the network. We also provide and interpret a dual to this problem and give polynomially bounded procedures for solving both problems. The primal location problem is solved with the aid of a related problem for which we also give a dual.

Suggested Citation

  • B. C. Tansel & R. L. Francis & T. J. Lowe & M. L. Chen, 1982. "Duality and Distance Constraints for the Nonlinear p -Center Problem and Covering Problem on a Tree Network," Operations Research, INFORMS, vol. 30(4), pages 725-744, August.
    • Handle: RePEc:inm:oropre:v:30:y:1982:i:4:p:725-744
    DOI: 10.1287/opre.30.4.725
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.30.4.725
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.30.4.725?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
    ---><---

    Citations

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


    Cited by:

    1. Chandra Ade Irawan & Said Salhi & Zvi Drezner, 2016. "Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex $$p$$ p -centre problems," Journal of Heuristics, Springer, vol. 22(4), pages 507-537, August.
    2. Richard Francis & Timothy Lowe, 2014. "Comparative error bound theory for three location models: continuous demand versus discrete demand," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 144-169, 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:inm:oropre:v:30:y:1982:i:4:p:725-744. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.