IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v83y1998i0p77-9410.1023-a1018972400378.html
   My bibliography  Save this article

On the boolean-quadric packinguncapacitated facility-location polytope

Author

Listed:
  • Jill Hardin
  • Jon Lee
  • Janny Leung

Abstract

We introduce and study the boolean-quadric uncapacitated packing facility-location polytope BQPUFLP(m, n), which is a model for uncapacitated facility-location problems, with m facilities and n customers, in which there are fixed costs associated with the operation of pairs of facilities. This problem arises in the design of two-level telecommunication networks in which the embedded backbone network is full-meshed and the local networks are of star type. We study the facial structure of BQPUFLP(m, n); in particular, we demonstrate that every facet of the boolean-quadric polytope BQP(m) is a facet of BQPUFLP(m, n),we introduce some facets of BQPUFLP(m, n) that are not related to BQP(m), and we provide a complete description of the facets of BQPUFLP(m, n) when m=3. Finally, we describe a cutting-plane algorithm based on our results, and we report on the results of computational experiments on problems with m=50 facilities and n=1000 customers. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Jill Hardin & Jon Lee & Janny Leung, 1998. "On the boolean-quadric packinguncapacitated facility-location polytope," Annals of Operations Research, Springer, vol. 83(0), pages 77-94, October.
    • Handle: RePEc:spr:annopr:v:83:y:1998:i:0:p:77-94:10.1023/a:1018972400378
    DOI: 10.1023/A:1018972400378
    as

    Download full text from publisher

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

    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:spr:annopr:v:83:y:1998:i:0:p:77-94:10.1023/a:1018972400378. 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.