Primal-dual schema for capacitated covering problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5035 LNCS, Issue , 2008, Pages 288-302

  Carnes, Tim ^a   Shmoys, David ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AEROSPACE APPLICATIONS; ALGORITHMS; ALUMINUM; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; EVOLUTIONARY ALGORITHMS; FACILITIES; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; MULTITASKING; NONLINEAR PROGRAMMING; OPTIMIZATION; SCHEDULING ALGORITHMS;

CAPACITATED FACILITY LOCATION PROBLEM (CFLP); COVERING PROBLEMS; ELLIPSOID ALGORITHM; GENERAL (CO); HEIDELBERG (CO); INTERNATIONAL CONFERENCES; KNAPSACK PROBLEMS; LINEAR PROGRAMMING (LP) RELAXATION; LOT SIZING PROBLEM (LSP); PERFORMANCE GUARANTEES; PHILLIPS (CO); PRIMAL-DUAL; PRIMAL-DUAL ALGORITHMS; SPRINGER (CO); VALID INEQUALITIES;

APPROXIMATION ALGORITHMS;

EID: 45749151144     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68891-4_20     Document Type: Conference Paper

References (14)

1. Aardal, K., Pochet, Y., Wolsey, L.A.: Capacitated facility location: valid inequalities and facets. Math. Oper. Res. 20(3), 562-582 (1995)
2. Agrawal, A., Klein, P., Ravi, R.: When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM J. Comput. 24(3), 440-456 (1995)
3. Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. J. Algorithms 2(2), 198-203 (1981)
4. Bertsimas, D., Teo, C.P.: From valid inequalities to heuristics: a unified view of primal-dual approximation algorithms in covering problems. Operations Research 46(4), 503-514 (2003)
5. Carr, R.D., Fleischer, L., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 106-115 (2000)
6. Chuzhoy, J., Naor, J.: Covering problems with hard capacities. SIAM J. Com-put. 36(2), 498-515 (2006)
7. Chvátal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233-235 (1979)
8. Even, G., Levi, R., Rawitz, D., Schieber, B., Shahar, S., Sviridenko, M.: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Trans. on Algorithms (submitted, 2007)
9. Gandhi, R., Halperin, E., Khuller, S., Kortsarz, G., Srinivasan, A.: An improved approximation algorithm for vertex cover with hard capacities. Journal of Computer and System Sciences 72(1), 16-33 (2006)
10. Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296-317 (1995)
11. Levi, R., Lodi, A., Sviridenko, M.: Approximation algorithms for the multi-item capacitated lot-sizing problem via flow-cover inequalities. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 454-468. Springer, Heidelberg (2007)
12. Levi, R., Roundy, R., Shmoys, D.B.: Primal-dual algorithms for deterministic inventory problems. Math. Oper. Res. 31(2), 267-284 (2006)
13. Sharma, Y., Williamson, D.: Personal communication (2007)
14. van Hoesel, C.P.M., Wagelmans, A.P.M.: Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. Math. Oper. Res. 26(2), 339-357 (2001)