Approximation algorithms for problems combining facility location and network design
成果类型：
Article
署名作者：
Ravi, R; Sinha, A
署名单位：
Carnegie Mellon University; University of Michigan System; University of Michigan
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.1050.0228
发表日期：
2006
页码：
73-81
关键词：
摘要：
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.