 On the boolean-quadric packinguncapacitated facility-location polytopeJill Hardin, Jon Lee and Janny Leung Annals of Operations Research, 1998, vol. 83, issue 0, 77-94 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 Date: 1998 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:83:y:1998:i:0:p:77-94:10.1023/a:1018972400378 Ordering information: This journal article can be ordered from Access Statistics for this article Annals of Operations Research is currently edited by Endre Boros More articles in Annals of Operations Research from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.