Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A 3-approximation algorithm for the k-level uncapacitated facility location problem
Information Processing Letters
A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Cost-distance: two metric network design
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
SIAM Journal on Discrete Mathematics
Approximating the two-level facility location problem via a quasi-greedy approach
Mathematical Programming: Series A and B
A review of hierarchical facility location models
Computers and Operations Research
The capacity and distance constrained plant location problem
Computers and Operations Research
A new approximation algorithm for the multilevel facility location problem
Discrete Applied Mathematics
Improved approximation algorithms for multilevel facility location problems
Operations Research Letters
A note on the maximization version of the multi-level facility location problem
Operations Research Letters
Operations Research Letters
Computers and Industrial Engineering
| Hi-index | 0.01 |
The vendor location problem is the problem of locating a given number of vendors and determining the number of vehicles and the service zones necessary for each vendor to achieve at least a given profit. We consider two versions of the problem with different objectives: maximizing the total profit and maximizing the demand covered. The demand and profit generated by a demand point are functions of the distance to the vendor. We propose integer programming models for both versions of the vendor location problem. We then prove that both are strongly NP-hard and we derive several families of valid inequalities to strengthen our formulations. We report the outcomes of a computational study where we investigate the effect of valid inequalities in reducing the duality gaps and the solution times for the vendor location problem.