A primal-dual approximation algorithm for the Steiner forest problem
Information Processing Letters
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Analysis of a local search heuristic for facility location problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Cost-distance: two metric network design
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
An Approximation Algorithm for Minimum-Cost Network Design
An Approximation Algorithm for Minimum-Cost Network Design
Approximating connected facility location problems via random facility sampling and core detouring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Multicast Routings in a Network with Multi-Sources
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Designing Multimodal Freight Transport Networks: A Heuristic Approach and Applications
Transportation Science
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences
Approximation Algorithms for Multicommodity Facility Location Problems
SIAM Journal on Discrete Mathematics
An augmented beam search-based algorithm for the circular open dimension problem
Computers and Industrial Engineering
Approximation Algorithms for Capacitated Location Routing
Transportation Science
| Hi-index | 0.00 |
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.