Approximation Algorithms for Problems Combining Facility Location and Network Design

R. Ravi () and Amitabh Sinha ()
Additional contact information
R. Ravi: David A. Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
Amitabh Sinha: Stephen M. Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109

Operations Research, 2006, vol. 54, issue 1, 73-81

Abstract: We present approximation algorithms for integrated logistics problems that combine elements of facility location and transport network design. We first study the problem where opening facilities incurs opening costs and transportation from the clients to the facilities incurs buy-at-bulk costs, and provide a combinatorial approximation algorithm. We also show that the integer-programming formulation of this problem has small integrality gap. We extend the model to the version when there is a bound on the number of facilities that may be opened.

Keywords: facilities; location; discrete; networks/graphs; flow algorithms; transportation; models; networks (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1050.0228 (application/pdf)

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:inm:oropre:v:54:y:2006:i:1:p:73-81

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().