Integrality gaps of linear and semi-definite programming relaxations for knapsack

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

Volumn 6655 LNCS, Issue , 2011, Pages 301-314

  Karlin, Anna R ^a   Mathieu, Claire ^b   Nguyen, C Thach ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

^b BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECOMPOSITION THEOREMS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; INTEGRALITY GAPS; LINEAR PROGRAMS; SEMI-DEFINITE PROGRAMMING;

COMBINATORIAL OPTIMIZATION; DOMAIN DECOMPOSITION METHODS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; THEOREM PROVING;

INTEGER PROGRAMMING;

EID: 79959942329     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20807-2_24     Document Type: Conference Paper

References (42)

1. Alekhnovich, M., Arora, S., Tourlakis, I.: Towards strong non-approximability results in the Lovász-Schrijver hierarchy. In: ACM STOC (2005)
2. Arora, S., Bollobás, B., Lovász, L., Tourlakis, I.: Proving integrality gaps without knowing the linear program. Theory of Computing 2, 19-51 (2006)
3. Arora, S., Rao, S., Vazirani, U.V.: Expander flows, geometric embeddings and graph partitioning. J. ACM 56(2) (2009)
4. Balas, E.: Facets of the Knapsack Polytope (1998)
5. Balas, E., Ceria, S., Cornuéjols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming 58, 295-324 (1993)
6. Balas, E., Zemel, E.: Facets of the knapsack polytope from minimal covers. SIAM Journal on Applied Mathematics 34, 119-148 (1978)
7. Bateni, M.H., Charikar, M., Guruswami, V.: MaxMin allocation via degree lowerbounded arborescences. In: ACM STOC (2009)
8. Benabbas, S., Magen, A.: Extending SDP integrality gaps to sherali-adams with applications to QUADRATIC PROGRAMMING and MAXCUTGAIN. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 299-312. Springer, Heidelberg (2010)
9. Bienstock, D.: Approximate formulations for 0-1 knapsack sets. Operational Research Letters 36(3), 317-320 (2008)
10. Bienstock, D., Ozbay, N.: Tree-width and the Sherali-Adams operator. Discrete Optimization 1(1), 13-21 (2004)
11. Buresh-Oppenheim, J., Galesi, N., Hoory, S., Magen, A., Pitassi, T.: Rank bounds and integrality gaps for cutting plane procedures. In: IEEE FOCS (2003)
12. Charikar, M.: On semidefinite programming relaxations for graph coloring and vertex cover. In: ACM-SIAM SODA (2002)
13. Charikar, M., Makarychev, K., Makarychev, Y.: Integrality gaps for Sherali-Adams relaxations. In: ACM STOC (2009)
14. Ω(1) integrality gap for the Sparsest Cut SDP. In: IEEE FOCS (2009)
15. Chlamtac, E.: Approximation algorithms using hierarchies of semidefinite programming relaxations. In: IEEE FOCS (2007)
16. Chlamtac, E., Singh, G.: Improved approximation guarantees through higher levels of SDP hierarchies. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol. 5171, pp. 49-62. Springer, Heidelberg (2008)
17. Fernandez de la Vega, W., Kenyon-Mathieu, C.: Linear programming relaxations of MaxCut. In: ACM-SIAM SODA (2007)
18. Escudero, L.F., Garn, A.: An o(n log n) procedure for identifying facets of the knapsack polytope. Operational Research Letters 31(3), 211-218 (2003)
19. Georgiou, K., Magen, A., Pitassi, T., Tourlakis, I.: Integrality gaps of 2 - o(1) for vertex cover SDPs in the Lovász-Schrijver hierarchy. In: IEEE FOCS (2007)
20. Georgiou, K., Magen, A., Tourlakis, I.: Vertex cover resists sDPs tightened by local hypermetric inequalities. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. IPCO, pp. 140-153. Springer, Heidelberg (2008)
21. Georgiou, K., Magen, A., Tulsiani, M.: Optimal sherali-adams gaps from pairwise independence. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol. 5687, pp. 125-139. Springer, Heidelberg (2009)
22. Hartvigsen, D., Zemel, E.: On the computational complexity of facets and valid inequalities for the knapsack problem. Discrete Applied Math. 39, 113-123 (1992)
23. 1 embeddability of negative type metrics. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol. 4627, pp. 164-179. Springer, Heidelberg (2007)
24. Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM (1975)
25. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack problems. Springer, Heidelberg (2003)
26. 1- embeddability. In: IEEE FOCS (2009)
27. Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0-1 programs. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, p. 293. Springer, Heidelberg (2001)
28. Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization 11, 796-817 (2001)
29. Laurent, M.: A comparison of the Sherali-Adams, Lovász-schrijver and Lasserre relaxations for 0-1 programming. Mathematics of Operations Research 28, 470-496 (2003)
30. Lawler, E.L.: Fast approximation algorithms for knapsack problems. In: IEEE FOCS (1997)
31. Lovász, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM Journal on Optimization 1, 166-190 (1991)
32. Pitassi, T., Segerlind, N.: Exponential lower bounds and integrality gaps for treelike Lovász-Schrijver procedures. In: ACM-SIAM SODA (2009)
33. Raghavendra, P.: Optimal algorithms and inapproximability results for every CSP? In: ACM STOC (2008)
34. Raghavendra, P., Steurer, D.: Integrality gaps for strong SDP relaxations of unique games. In: IEEE FOCS (2009)
35. Schoenebeck, G.: Linear level Lasserre lower bounds for certain k-csps. In: IEEE FOCS (2008)
36. Schoenebeck, G., Trevisan, L., Tulsiani, M.: Tight integrality gaps for Lovász-Schrijver SDP relaxations of vertex cover and max cut. In: ACM STOC, pp. 302-310 (2007)
37. Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics 3, 411-430 (1990)
38. Tourlakis, I.: New lower bounds for vertex cover in the Lovász-Schrijver hierarchy. In: IEEE CCC (2006)
39. Tulsiani, M.: CSP gaps and reductions in the Lasserre hierarchy. In: ACM STOC (2009)
40. Weismantel, R.: On the 0/1 knapsack polytope. Mathematical Programming 77, 49-68 (1997)
41. Wolsey, L.A.: Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints. Discrete Applied Mathematics 29(2-3), 251-261 (1990)
42. Zemel, E.: Easily computable facets of the knapsack problem. Mathematics of Operations Research 14, 760-774 (1989)