Convex hull of two quadratic or a conic quadratic and a quadratic inequality
暂无分享,去创建一个
[1] James R. Luedtke,et al. Effective separation of disjunctive cuts for convex mixed integer nonlinear programs , 2010 .
[2] Fatma Kilinç-Karzan,et al. On Minimal Valid Inequalities for Mixed Integer Conic Programs , 2014, Math. Oper. Res..
[3] S. Ulbrich,et al. MIXED INTEGER SECOND ORDER CONE PROGRAMMING , 2008 .
[4] G. Cornuéjols,et al. Corner Polyhedron and Intersection Cuts , 2011 .
[5] Andrea Lodi,et al. Mixed Integer Programming Computation , 2010, 50 Years of Integer Programming.
[6] Daniel Dadush,et al. On the Chvátal–Gomory closure of a compact convex set , 2011, Mathematical Programming.
[7] Pierre Bonami,et al. Lift-and-Project Cuts for Mixed Integer Convex Programs , 2011, IPCO.
[8] Alberto Del Pia,et al. Relaxations of mixed integer sets from lattice-free polyhedra , 2016, Ann. Oper. Res..
[9] Alper Atamtürk,et al. Conic mixed-integer rounding cuts , 2009, Math. Program..
[10] Juan Pablo Vielma,et al. A Strong Dual for Conic Mixed-Integer Programs , 2012, SIAM J. Optim..
[11] Julio C. Góez,et al. A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization , 2015 .
[12] G. Nemhauser,et al. Integer Programming , 2020 .
[13] Juan Pablo Vielma,et al. Intersection cuts for nonlinear integer programming: convexification techniques for structured sets , 2013, Mathematical Programming.
[14] Kent Andersen,et al. Intersection Cuts for Mixed Integer Conic Quadratic Sets , 2013, IPCO.
[15] Sanjay Mehrotra,et al. A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..
[16] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra , 1972, Math. Program..
[17] Marc Teboulle,et al. Hidden convexity in some nonconvex quadratically constrained quadratic programming , 1996, Math. Program..
[18] Laurence A. Wolsey,et al. A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..
[19] Daniel Dadush,et al. The Chvátal-Gomory Closure of a Strictly Convex Body , 2011, Math. Oper. Res..
[20] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..
[21] Gérard Cornuéjols,et al. Valid inequalities for mixed integer linear programs , 2007, Math. Program..
[22] Daniel Bienstock,et al. Strong formulations for convex functions over nonconvex sets , 2012 .
[23] H. Milton,et al. On the Chvatal-Gomory Closure of a Compact Convex Set , 2010 .
[24] Robert E. Bixby,et al. Progress in computational mixed integer programming—A look back from the other side of the tipping point , 2007, Ann. Oper. Res..
[25] Laurence A. Wolsey,et al. Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..
[26] Martin W. P. Savelsbergh,et al. Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition , 2000, INFORMS J. Comput..
[27] Pietro Belotti,et al. A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization , 2015, Discret. Optim..
[28] Tobias Achterberg,et al. SCIP: solving constraint integer programs , 2009, Math. Program. Comput..
[29] J. Hiriart-Urruty,et al. Fundamentals of Convex Analysis , 2004 .
[30] Thierry Marchant,et al. No end of the world in 2012 for 4OR , 2012, 4OR.
[31] Sina Modaresi,et al. Valid inequalities and reformulation techniques for Mixed Integer Nonlinear Programming , 2015 .
[32] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[33] Gérard Cornuéjols,et al. Disjunctive cuts for cross-sections of the second-order cone , 2015, Oper. Res. Lett..
[34] Mehmet Tolga Çezik,et al. Cuts for mixed 0-1 conic programming , 2005, Math. Program..
[35] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .
[36] Ugur Yildiran,et al. Convex hull of two quadratic constraints is an LMI set , 2009, IMA J. Math. Control. Inf..
[37] Daniel Dadush,et al. The split closure of a strictly convex body , 2011, Oper. Res. Lett..
[38] Daniel Bienstock,et al. Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets , 2014, SIAM J. Optim..
[39] Alper Atamtürk,et al. Cuts for Conic Mixed-Integer Programming , 2007, IPCO.
[40] Gérard Cornuéjols,et al. Polyhedral Approaches to Mixed Integer Linear Programming , 2010, 50 Years of Integer Programming.
[41] Sercan Yildiz,et al. Two-term disjunctions on the second-order cone , 2014, IPCO.
[42] Juan Pablo Vielma,et al. Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming , 2015, Oper. Res. Lett..
[43] Robert E. Bixby,et al. Mixed-Integer Programming: A Progress Report , 2004, The Sharpest Cut.
[44] Pietro Belotti,et al. On families of quadratic surfaces having fixed intersections with two hyperplanes , 2013, Discret. Appl. Math..
[45] Samuel Burer,et al. How to convexify the intersection of a second order cone and a nonconvex quadratic , 2014, Math. Program..
[46] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.