Approximate fixed-rank closures of covering problems

Mathematical Programming

Volumn 105, Issue 1, 2006, Pages 9-27

  Bienstock, Daniel ^a   Zuckerberg, Mark ^a  

^a Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; POLYNOMIALS; PROBLEM SOLVING; RELAXATION PROCESSES;

COVERING PROBLEMS; FIXED-RANK CLOSURES; SET-COVERING PROBLEMS;

INTEGER PROGRAMMING;

EID: 28244445529     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-005-0598-z     Document Type: Article

References (18)

1. [BCC96] Balas, E., Ceria, S., Cornuéjols, G.: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-cut Framework. Management Science 42, 1229-1246 (1996)
2. [BO04] Bienstock, D., Ozbay, N.: Tree-width and the Sherali-Adams operator. Discrete Optimization 1, 13-22 (2004)
3. [BZ02a] Bienstock, D., Zuckerberg, M.: Subset algebra lift operators for 0-1 integer programming. To appear, SIAM J. Optimization
4. [BZ02b] Bienstock, D., Zuckerberg, M.: Subset algebra lift operators for 0-1 integer programming (Extended version), CORC Report TR-2002-01, Columbia University, 2002
5. [BZ03] Bienstock, D., Zuckerberg, M.: Approximate fixed-rank closures of covering problems. CORC Report TR-2003-01, Columbia University, 2003
6. [CL03] Caprara, A., Letchford, A. (2000): On the separation of split cuts and related inequalities. Mathematical Programming 94, 279-294 (2003)
7. [CD01] Cook, W., Dash, S.: On the matrix-cut rank of polyhedra. Math. Oper. Res. 26, 19-30 (2001)
8. [CL01] Cornuéjols, G., Li, Y.: A connection between cutting plane theory and the geometry of numbers. Math. Programming 93, 2002
9. [E99] Eisenbrand, F.: On the membership problem for the elementary closure of a polyhedron. Combinatorica 19, 297-300 (1999)
10. [GT01] Goemans, M.X., Tunçel, L.: When does the positive semidefiniteness constraint help in lifting procedures, manuscript, 2000
11. [Las01] Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0-1 programs. In: Lecture Notes in Computer Science K. Aardal, A.M.H. Gerards (eds.), 2001, pp. 293-303
12. [Lau01] Laurent, M.: A Comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre Relaxations for 0-1 Programming. Math. Oper. Res. 28, 470-496 (2003)
13. [LS91] Lovász, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optimization 1, 166-190 (1991)
14. [Le01] Letchford, A.N.: On disjunctive cuts for combinatorial optimization. J. Comb. Opt. 5, 299-315 (2001)
15. [Le04] Letchford, A.N.: Separation of {0, 1/2}-cuts is hard even for set packing. Manuscript, July 2004
16. [NW88] Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York, 1988
17. [Z03] Zuckerberg, M.: A set theoretic approach to lifting procedures for 0, 1 integer programming. Ph.D. Thesis, Columbia University, 2004
18. [SA90] Sherali, S., Adams, W.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Mathematics 3, 411-430 (1990)