An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
暂无分享,去创建一个
[1] Robert E. Bixby,et al. MIP: Theory and Practice - Closing the Gap , 1999, System Modelling and Optimization.
[2] William J. Cook,et al. On the Matrix-Cut Rank of Polyhedra , 2001, Math. Oper. Res..
[3] Alexander Schrijver,et al. On Cutting Planes , 1980 .
[4] Dima Grigoriev,et al. Complexity of Semi-algebraic Proofs , 2002, STACS.
[5] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..
[6] A. Razborov. Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic , 1995 .
[7] Pavel Pudlák,et al. Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.
[8] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[9] Laurence A. Wolsey,et al. Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..
[10] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.
[11] Gérard Cornuéjols,et al. A connection between cutting plane theory and the geometry of numbers , 2002, Math. Program..
[12] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[13] Vasek Chvátal. Cutting Planes in Combinatorics , 1985, Eur. J. Comb..
[14] Friedrich Eisenbrand,et al. Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube , 1999, IPCO.
[15] L. Lov. STABLE SETS AND POLYNOMIALS , 1994 .
[16] P. Pudlák. Sets and Proofs: On the Complexity of the Propositional Calculus , 1999 .
[17] Monique Laurent,et al. Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lov[a-acute]sz--Schrijver Lift-and-Project Procedure , 2002, SIAM J. Optim..
[18] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .
[19] William J. Cook,et al. On the Complexity of Branch and Cut Methods for the Traveling Salesman Problem , 1990, Polyhedral Combinatorics.
[20] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[21] Endre Szemerédi,et al. Many hard examples for resolution , 1988, JACM.
[22] Egon Balas,et al. Gomory cuts revisited , 1996, Oper. Res. Lett..
[23] Discretely Ordered Modules as a First-Order Extension of The Cutting Planes Proof System , 1998, J. Symb. Log..
[24] Laurence A. Wolsey,et al. A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..
[25] Robert G. Jeroslow,et al. Trivial integer programs unsolvable by branch-and-bound , 1974, Math. Program..
[26] Hanif D. Sherali,et al. A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..
[27] Ravi B. Boppana,et al. The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[28] Vasek Chvátal,et al. Hard Knapsack Problems , 1980, Oper. Res..
[29] Toniann Pitassi,et al. Propositional Proof Complexity: Past, Present and Future , 2001, Bull. EATCS.
[30] Pradeep Dubey,et al. Inefficiency of Nash Equilibria , 1986, Math. Oper. Res..
[31] E. Balas,et al. Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .
[32] William J. Cook,et al. Combinatorial optimization , 1997 .
[33] Jan Krajícek,et al. Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic , 1997, Journal of Symbolic Logic.
[34] Edward A. Hirsch,et al. Several notes on the power of Gomory-Chvátal cuts , 2003, Ann. Pure Appl. Log..
[35] Noga Alon,et al. The monotone circuit complexity of boolean functions , 1987, Comb..
[36] László Lovász,et al. Stable sets and polynomials , 1994, Discret. Math..
[37] Friedrich Eisenbrand,et al. NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron , 1999, Comb..
[38] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[39] Robert G. Jeroslow. A Cutting-Plane Game for Facial Disjunctive Programs , 1980 .
[40] Jan Krajícek,et al. Lower bounds to the size of constant-depth propositional proofs , 1994, Journal of Symbolic Logic.
[41] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..
[42] Stephen A. Cook,et al. An Exponential Lower Bound for the Size of Monotone Real Circuits , 1999, J. Comput. Syst. Sci..
[43] Michel X. Goemans,et al. When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? , 2001, Math. Oper. Res..
[44] Mark Evan Hartmann,et al. Cutting planes and the complexity of the integer hull , 1989 .
[45] William J. Cook,et al. On cutting-plane proofs in combinatorial optimization , 1989 .
[46] Sanjeeb Dash. On the Matrix Cuts of Lovász and Schrijver and Their Use in Integer Programming , 2001 .
[47] Martin W. P. Savelsbergh,et al. Lifted Cover Inequalities for 0-1 Integer Programs: Complexity , 1999, INFORMS J. Comput..
[48] Friedrich Eisenbrand,et al. Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube* , 2003, Comb..
[49] William J. Cook,et al. On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..
[50] R. Gomory. AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .
[51] Peter Clote,et al. Cutting planes, connectivity, and threshold logic , 1996, Arch. Math. Log..
[52] Alberto Caprara,et al. On the separation of split cuts and related inequalities , 2003, Math. Program..
[53] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[54] Gérard Cornuéjols,et al. Elementary closures for integer programs , 2001, Oper. Res. Lett..
[55] Ran Raz,et al. Lower bounds for cutting planes proofs with small coefficients , 1995, Symposium on the Theory of Computing.
[56] William R. Pulleyblank,et al. Clique Tree Inequalities and the Symmetric Travelling Salesman Problem , 1986, Math. Oper. Res..
[57] William J. Cook. Cutting-plane proofs in polynomial space , 1990, Math. Program..
[58] Miklós Ajtai. The complexity of the Pigeonhole Principle , 1994, Comb..
[59] Armin Haken,et al. The Intractability of Resolution , 1985, Theor. Comput. Sci..