A cross decomposition algorithm for capacitated facility location
Operations Research
A man-machine approach toward solving the traveling salesman problem
Communications of the ACM
Using a facility location algorithm to solve large set covering problems
Operations Research Letters
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
A number of algorithms have been designed for uncapacitated facility location problems. Computational experience with standard data sets seems to indicate the superiority of dual approaches, best known through efficient subgradient or dual adjustment procedures. However, linear programming algorithms provide distinct advantages, in particular direct amenability to cutting-plane techniques. A streamlined dual simplex algorithm is designed based on a covering formulation of the problem and present computational results.