Probabilistic analysis of a relaxation for the k-median problem
Mathematics of Operations Research
A projection method for the uncapacitated facility location problem
Mathematical Programming: Series A and B
Solving the Simple Plant Location Problem using a Data Correcting Approach
Journal of Global Optimization
Quick and good facility location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Branch and peg algorithms for the simple plant location problem
Computers and Operations Research
Solving the uncapacitated facility location problem using tabu search
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Approximation Algorithms for Metric Facility Location Problems
SIAM Journal on Computing
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
INFORMS Journal on Computing
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
SIAM Journal on Computing
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
Operations Research Letters
| Hi-index | 0.01 |
Some new, simple and extremely fast bounding procedures are presented for large-scale instances of the Simple Plant Location Problem. The lower-bounding procedures are based on dual ascent. The fastest of them runs in O(mnlogm) time, where m and n are the number of locations and clients, respectively. The upper-bounding procedures are based on iteratively dropping facilities, and the fastest of them runs in O(m(n+logm)) time. Extensive computational results show that, in practice, the procedures give very good bounds extremely quickly.