LP Solvable Location Problems on Networks

Yaoguang Wang
Additional contact information
Yaoguang Wang: Center for Operations Research and Econometrics (CORE), Université catholique de Louvain (UCL), Louvain la Neuve, Belgium

No 1996010, LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

Abstract: Given a network, the facility location problem consists of locating a set of sites on the network to serve existing clients so as to minimize its total cost. Special cases include the simple plant location problem (SPLP), bank account location, p-facility location, and p-median problem. We characterize families of networks on which all basic feasible solution from simple linear programming (LP) relaxations are integral. For all these location problems, we present a necessary and sufficient condition for which their basic LP solutions are integral. For the SPLP, we show that the basic LP solutions are integral if and only if the network contains no cycles of length 2 (mod 4), or equivalently, the graph is obtainable from an even ear composition. Finally, we study polyhedral structures of SPLP and characterize a class of facet inducing inequalities induced by odd cycles.

Keywords: Discrete location problem; undirected bipartite graph; location polyhedra; facet (search for similar items in EconPapers)
Date: 1996-04-01
References: Add references at CitEc
Citations:

Downloads: (external link)
https://sites.uclouvain.be/core/publications/coredp/coredp1996.html (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cor:louvco:1996010

Access Statistics for this paper

More papers in LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().