Cutting planes from extended LP formulations
暂无分享,去创建一个
[1] Gérard Cornuéjols,et al. On the Rank of Mixed 0, 1 Polyhedra , 2001, IPCO.
[2] Sanjeeb Dash,et al. Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse , 2017, INFORMS J. Comput..
[3] V. Kaibel. Extended Formulations in Combinatorial Optimization , 2011, 1104.1023.
[4] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[5] Kent Andersen,et al. Mixed-integer sets from two rows of two adjacent simplex bases , 2009, Math. Program..
[6] Juan Pablo Vielma,et al. Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming , 2015, Oper. Res. Lett..
[7] William J. Cook,et al. On cutting-plane proofs in combinatorial optimization , 1989 .
[8] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .
[9] Sanjeeb Dash,et al. Lattice-free sets, branching disjunctions, and mixed-integer programming , 2012 .
[10] Mark Evan Hartmann,et al. Cutting planes and the complexity of the integer hull , 1989 .
[11] Hans Raj Tiwary,et al. Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.
[12] Jiri Matousek,et al. Lectures on discrete geometry , 2002, Graduate texts in mathematics.
[13] Laurence A. Wolsey,et al. On the Practical Strength of Two-Row Tableau Cuts , 2014, INFORMS J. Comput..
[14] Garth P. McCormick,et al. Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..
[15] Ali Ridha Mahjoub,et al. Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs , 1994, SIAM J. Discret. Math..
[16] Monique Laurent,et al. A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2003, Math. Oper. Res..
[17] Hanif D. Sherali,et al. A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..
[18] Alberto Del Pia. On the Rank of Disjunctive Cuts , 2012, Math. Oper. Res..
[19] Oktay Günlük,et al. Mixing mixed-integer inequalities , 2001, Math. Program..
[20] M. L. Balinski,et al. ON MAXIMUM MATCHING, MINIMUM COVERING AND THEIR CONNECTIONS , 2015 .
[21] N. S. Barnett,et al. Private communication , 1969 .
[22] Egon Balas,et al. Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization , 2005, Ann. Oper. Res..
[23] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..
[24] Sanjeeb Dash,et al. On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs , 2009, SIAM J. Optim..
[25] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[26] Egon Balas,et al. The perfectly matchable subgraph polytope of a bipartite graph , 1983, Networks.
[27] Thomas Rothvoß,et al. The matching polytope has exponential extension complexity , 2013, STOC.
[28] See Balas. A Note on Split Rank of Intersection Cuts , 2008 .
[29] L. Wolsey,et al. Cutting Planes form Two Rows of a Simplex Tableau , 2007 .
[30] Leslie E. Trotter,et al. Properties of vertex packing and independence system polyhedra , 1974, Math. Program..
[31] E. Balas. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .
[32] Laurence A. Wolsey,et al. Inequalities from Two Rows of a Simplex Tableau , 2007, IPCO.