Valid inequalities and reformulation techniques for Mixed Integer Nonlinear Programming
暂无分享,去创建一个
[1] Alberto Caprara,et al. An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming , 2010, IPCO.
[2] Andrea Lodi,et al. MIR closures of polyhedral sets , 2009, Math. Program..
[3] Fatma Kilinc. On Minimal Valid Inequalities for Mixed Integer Conic Programs , 2015 .
[4] Nikolaos V. Sahinidis,et al. Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming , 2002 .
[5] Claus-Peter Schnorr,et al. Geometry of Numbers and Integer Programming (Summary) , 1988, STACS.
[6] Pablo A. Parrilo,et al. Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..
[7] Sanjeeb Dash,et al. Computational Experiments with Cross and Crooked Cross Cuts , 2014, INFORMS J. Comput..
[8] Juan Pablo Vielma. A constructive characterization of the split closure of a mixed integer linear program , 2007, Oper. Res. Lett..
[9] S. Ulbrich,et al. MIXED INTEGER SECOND ORDER CONE PROGRAMMING , 2008 .
[10] Warren P. Adams,et al. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .
[11] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra , 1972, Math. Program..
[12] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..
[13] Kent Andersen,et al. An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets , 2009, Math. Oper. Res..
[14] Kent Andersen,et al. Intersection Cuts for Mixed Integer Conic Quadratic Sets , 2013, IPCO.
[15] Rekha R. Thomas,et al. Semidefinite Optimization and Convex Algebraic Geometry , 2012 .
[16] Ralph E. Gomory,et al. Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem , 2010, 50 Years of Integer Programming.
[17] Kent Andersen,et al. Split closure and intersection cuts , 2002, Math. Program..
[18] Gérard Cornuéjols,et al. Valid inequalities for mixed integer linear programs , 2007, Math. Program..
[19] Alain Billionnet,et al. Extending the QCR method to general mixed-integer programs , 2010, Mathematical Programming.
[20] Daniel Bienstock,et al. Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets , 2014, SIAM J. Optim..
[21] Juan Pablo Vielma,et al. The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron , 2010, IPCO.
[22] 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 .
[23] Juan Pablo Vielma,et al. Mixed Integer Linear Programming Formulation Techniques , 2015, SIAM Rev..
[24] Alberto Del Pia,et al. Relaxations of mixed integer sets from lattice-free polyhedra , 2016, Ann. Oper. Res..
[25] Juan Pablo Vielma,et al. A Strong Dual for Conic Mixed-Integer Programs , 2012, SIAM J. Optim..
[26] Egon Balas,et al. programming: Properties of the convex hull of feasible points * , 1998 .
[27] Bernd Sturmfels,et al. On the convex hull of a space curve , 2009, ArXiv.
[28] Laurence A. Wolsey,et al. A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..
[29] R. Horst,et al. Global Optimization: Deterministic Approaches , 1992 .
[30] Jean B. Lasserre,et al. Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..
[31] Sercan Yildiz,et al. Two-term disjunctions on the second-order cone , 2014, IPCO.
[32] James R. Luedtke,et al. Effective separation of disjunctive cuts for convex mixed integer nonlinear programs , 2010 .
[33] Bernd Sturmfels,et al. The Convex Hull of a Variety , 2010, ArXiv.
[34] 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..
[35] Gérard Cornuéjols,et al. On the Rank of Mixed 0, 1 Polyhedra , 2001, IPCO.
[36] Pietro Belotti,et al. A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization , 2015, Discret. Optim..
[37] Laurence A. Wolsey,et al. Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..
[38] Juan Pablo Vielma,et al. Convex hull of two quadratic or a conic quadratic and a quadratic inequality , 2017, Math. Program..
[39] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .
[40] Martin W. P. Savelsbergh,et al. Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition , 2000, INFORMS J. Comput..
[41] Alper Atamtürk,et al. Conic mixed-integer rounding cuts , 2009, Math. Program..
[42] Shafi Goldwasser,et al. Complexity of lattice problems , 2002 .
[43] Iain Dunning,et al. Computing in Operations Research Using Julia , 2013, INFORMS J. Comput..
[44] Samuel Burer,et al. How to convexify the intersection of a second order cone and a nonconvex quadratic , 2014, Math. Program..
[45] Alper Atamtürk,et al. Cuts for Conic Mixed-Integer Programming , 2007, IPCO.
[46] Juan Pablo Vielma,et al. Intersection cuts for nonlinear integer programming: convexification techniques for structured sets , 2013, Mathematical Programming.
[47] Rekha R. Thomas,et al. Convex Hulls of Algebraic Sets , 2012 .
[48] G. Nemhauser,et al. Integer Programming , 2020 .
[49] Ugur Yildiran,et al. Convex hull of two quadratic constraints is an LMI set , 2009, IMA J. Math. Control. Inf..
[50] Franz Rendl,et al. A recipe for semidefinite relaxation for (0,1)-quadratic programming , 1995, J. Glob. Optim..
[51] Tobias Achterberg,et al. SCIP: solving constraint integer programs , 2009, Math. Program. Comput..
[52] H. Milton,et al. On the Chvatal-Gomory Closure of a Compact Convex Set , 2010 .
[53] Daniel Bienstock,et al. Strong formulations for convex functions over nonconvex sets , 2012 .
[54] Andrea Lodi,et al. Mixed Integer Programming Computation , 2010, 50 Years of Integer Programming.
[55] Egon Balas,et al. Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..
[56] Didier Henrion,et al. Semidefinite Representation of Convex Hulls of Rational Varieties , 2009, ArXiv.
[57] O. SIAMJ.. CONES OF MATRICES AND SUCCESSIVE CONVEX RELAXATIONS OF NONCONVEX SETS , 2000 .
[58] J. William Helton,et al. Semidefinite Representation of Convex Sets and Convex Hulls , 2012 .
[59] Sanjeeb Dash,et al. A note on the MIR closure and basic relaxations of polyhedra , 2011, Oper. Res. Lett..
[60] James V. Jucker,et al. Some Problems in Applying the Continuous Portfolio Selection Model to the Discrete Capital Budgeting Problem , 1978, Journal of Financial and Quantitative Analysis.
[61] H. Weingartner. Capital Budgeting of Interrelated Projects: Survey and Synthesis , 1966 .
[62] Egon Balas,et al. Generalized intersection cuts and a new cut generating paradigm , 2013, Math. Program..
[63] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[64] Adam N. Letchford,et al. A New Approach to the Stable Set Problem Based on Ellipsoids , 2011, IPCO.
[65] Yanjun Li,et al. Cook, Kannan and Schrijver's example revisited , 2008, Discret. Optim..
[66] Alain Billionnet,et al. Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method , 2009, Discret. Appl. Math..
[67] Sanjeeb Dash,et al. Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra , 2012, Math. Program..
[68] Y. Ye,et al. Semidefinite programming relaxations of nonconvex quadratic optimization , 2000 .
[69] Claus Scheiderer. Convex hulls of curves of genus one , 2010 .
[70] Robert E. Bixby,et al. Mixed-Integer Programming: A Progress Report , 2004, The Sharpest Cut.
[71] Daniel Dadush,et al. The Chvátal-Gomory Closure of a Strictly Convex Body , 2011, Math. Oper. Res..
[72] Daniel Dadush,et al. The split closure of a strictly convex body , 2011, Oper. Res. Lett..
[73] Marc Teboulle,et al. Hidden convexity in some nonconvex quadratically constrained quadratic programming , 1996, Math. Program..
[74] Mehmet Tolga Çezik,et al. Cuts for mixed 0-1 conic programming , 2005, Math. Program..
[75] G. Cornuéjols,et al. Corner Polyhedron and Intersection Cuts , 2011 .
[76] Sercan Yldz. Disjunctive Cuts for Cross-Sections of the Second-Order Cone , 2015 .
[77] Masakazu Kojima,et al. Semidefinite Programming Relaxation for Nonconvex Quadratic Programs , 1997, J. Glob. Optim..
[78] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..
[79] Richard D. McBride,et al. Finding the Integer Efficient Frontier for Quadratic Capital Budgeting Problems , 1981, Journal of Financial and Quantitative Analysis.
[80] Iain Dunning,et al. Extended formulations in mixed integer conic quadratic programming , 2015, Mathematical Programming Computation.
[81] Pietro Belotti,et al. On families of quadratic surfaces having fixed intersections with two hyperplanes , 2013, Discret. Appl. Math..
[82] Sanjay Mehrotra,et al. A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..
[83] Tamás Terlaky,et al. A Survey of the S-Lemma , 2007, SIAM Rev..
[84] Juan Pablo Vielma,et al. Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming , 2015, Oper. Res. Lett..
[85] Pierre Bonami,et al. Lift-and-Project Cuts for Mixed Integer Convex Programs , 2011, IPCO.
[86] Gérard Cornuéjols,et al. Polyhedral Approaches to Mixed Integer Linear Programming , 2010, 50 Years of Integer Programming.
[87] Hassan L. Hijazi,et al. An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs , 2014, INFORMS J. Comput..