-
1
-
-
0000894590
-
Capacitated facility location: Separation algorithms and computational experience
-
K. Aardal. Capacitated facility location: separation algorithms and computational experience. Mathematical Programming, 81:149-175, 1998.
-
(1998)
Mathematical Programming
, vol.81
, pp. 149-175
-
-
Aardal, K.1
-
2
-
-
0033900420
-
Strengthening integrality gaps for capacitated network design and covering problems
-
R. Carr, L. Fleischer, V. Leung, and C. Phillips. Strengthening integrality gaps for capacitated network design and covering problems. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 106-115, 2000.
-
(2000)
Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms
, pp. 106-115
-
-
Carr, R.1
Fleischer, L.2
Leung, V.3
Phillips, C.4
-
3
-
-
84948955787
-
Improved approximation algorithms for capacitated facility location problems
-
G. Cornuéjols, R. E. Burkard, and G. J. Woeginger, editors, Integer Programming and Combinatorial Optimization, Graz, Springer
-
F. A. Chudak and D. P. Williamson. Improved approximation algorithms for capacitated facility location problems. In G. Cornuéjols, R. E. Burkard, and G. J. Woeginger, editors, Integer Programming and Combinatorial Optimization, volume 1610 of Lecture Notes in Computer Science, pages 99-113, Graz, 1999. Springer.
-
(1999)
Lecture Notes in Computer Science
, vol.1610
, pp. 99-113
-
-
Chudak, F.A.1
Williamson, D.P.2
-
4
-
-
0000682161
-
Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation
-
K. Jain and V.V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM, 48:274-296, 2001.
-
(2001)
Journal of the ACM
, vol.48
, pp. 274-296
-
-
Jain, K.1
Vazirani, V.V.2
-
5
-
-
0038425786
-
Analysis of a local search heuristic for facility location problems
-
M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. Journal of Algorithms, 37(1):146-188, 2000.
-
(2000)
Journal of Algorithms
, vol.37
, Issue.1
, pp. 146-188
-
-
Korupolu, M.R.1
Plaxton, C.G.2
Rajaraman, R.3
-
9
-
-
84937441113
-
Approximation algorithms for facility location problems
-
D. B. Shmoys. Approximation algorithms for facility location problems. In Proceedings of 3rd APPROX, pages 27-33, 2000.
-
(2000)
Proceedings of 3rd APPROX
, pp. 27-33
-
-
Shmoys, D.B.1
-
10
-
-
0038309442
-
An approximation algorithm for the generalized assignment problem
-
D. B. Shmoys and É. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming A, 62:461-474, 1993.
-
(1993)
Mathematical Programming A
, vol.62
, pp. 461-474
-
-
Shmoys, D.B.1
Tardos, É.2
-
13
-
-
35048840446
-
A multi-exchange local search algorithm for the capacitated facility location problem
-
Submitted
-
J. Zhang, B. Chen, and Y. Ye. A multi-exchange local search algorithm for the capacitated facility location problem. Submitted to Mathematics of Operations Research, 2003.
-
(2003)
Mathematics of Operations Research
-
-
Zhang, J.1
Chen, B.2
Ye, Y.3
|