Approximation algorithms for facility location problems (extended abstract)
暂无分享,去创建一个
[1] J. Stollsteimer. A Working Model for Plant Numbers and Locations , 1963 .
[2] Alfred A. Kuehn,et al. A Heuristic Program for Locating Warehouses , 1963 .
[3] A. Manne. Plant Location Under Economies-of-Scale---Decentralization and Computation , 1964 .
[4] G. Nemhauser,et al. Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .
[5] Pierre Hansen,et al. A Plant and Warehouse Location Problem , 1977 .
[6] George L. Nemhauser,et al. Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .
[7] Tony J. Van Roy,et al. A Dual-Based Procedure for Dynamic Facility Location , 1982 .
[8] Dorit S. Hochbaum,et al. Heuristics for the fixed cost median problem , 1982, Math. Program..
[9] D. Tcha,et al. A branch-and-bound algorithm for the multi-level uncapacitated facility location problem , 1984 .
[10] D. Hochbaum,et al. A best possible approximation algorithm for the k--center problem , 1985 .
[11] A. Frieze,et al. A simple heuristic for the p-centre problem , 1985 .
[12] George L. Nemhauser,et al. The uncapacitated facility location problem , 1990 .
[13] Bhaba R. Sarker,et al. Discrete location theory , 1991 .
[14] Said Salhi,et al. Discrete Location Theory , 1991 .
[15] Jeffrey Scott Vitter,et al. Approximation Algorithms for Geometric Median Problems , 1992, Inf. Process. Lett..
[16] J. Vitter,et al. Approximations with Minimum Packing Constraint Violation , 1992 .
[17] Jeffrey Scott Vitter,et al. e-approximations with minimum packing constraint violation (extended abstract) , 1992, STOC '92.
[18] Judit Bar-Ilan,et al. How to Allocate Network Centers , 1993, J. Algorithms.
[19] D. Shmoys,et al. An improved approximation algorithm for the generalized assignment problem , 1993 .
[20] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..
[21] Samir Khuller,et al. The Capacitated K-Center Problem (Extended Abstract) , 1996, ESA.
[22] Karen Aardal,et al. On the Two-Level Uncapacitated Facility Location Problem , 1996, INFORMS J. Comput..
[23] David B. Shmoys,et al. Scheduling to minimize average completion time: off-line and on-line algorithms , 1996, SODA '96.
[24] David B. Shmoys,et al. Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..
[25] Michel X. Goemans,et al. Improved approximation algorthims for scheduling with release dates , 1997, SODA '97.
[26] Rajeev Motwani,et al. Approximation techniques for average completion time scheduling , 1997, SODA '97.