On Minimal Valid Inequalities for Mixed Integer Conic Programs
暂无分享,去创建一个
[1] Daniel E. Steffy,et al. On sublinear inequalities for mixed integer conic programs , 2016, Math. Program..
[2] Gérard Cornuéjols,et al. Disjunctive cuts for cross-sections of the second-order cone , 2015, Oper. Res. Lett..
[3] Mehmet Tolga Çezik,et al. Cuts for mixed 0-1 conic programming , 2005, Math. Program..
[4] Christian Kirches,et al. Mixed-integer nonlinear optimization*† , 2013, Acta Numerica.
[5] R. Hildebrand. An LMI description for the cone of Lorentz-positive maps , 2007 .
[6] Gérard Cornuéjols,et al. Minimal Valid Inequalities for Integer Constraints , 2009, Math. Oper. Res..
[7] Masakazu Kojima,et al. Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets , 1999, SIAM J. Optim..
[8] Jean-Philippe P. Richard,et al. Convexification techniques for linear complementarity constraints , 2011, Journal of Global Optimization.
[9] Sebastian Pokutta,et al. Cutting-planes for weakly-coupled 0/1 second order cone programs , 2010, Electron. Notes Discret. Math..
[10] S. Burer,et al. The MILP Road to MIQCP , 2012 .
[11] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[12] Pietro Belotti,et al. Linear Programming Relaxations of Quadratically Constrained Quadratic Programs , 2012, ArXiv.
[13] Robert G. Jeroslow,et al. Minimal inequalities , 1979, Math. Program..
[14] Jon Lee,et al. Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs , 2008, IPCO.
[15] Gérard Cornuéjols,et al. Cut-Generating Functions for Integer Variables , 2016, Math. Oper. Res..
[16] Farid Alizadeh,et al. Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..
[17] Gérard Cornuéjols,et al. Cut-Generating Functions , 2013, IPCO.
[18] Hanif D. Sherali,et al. A reformulation-convexification approach for solving nonconvex quadratic programming problems , 1995, J. Glob. Optim..
[19] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra , 1972, Math. Program..
[20] Giacomo Zambelli,et al. Convex Sets and Minimal Sublinear Functions , 2010 .
[21] Michel X. Goemans,et al. Semideenite Programming in Combinatorial Optimization , 1999 .
[22] Juan Pablo Vielma,et al. Intersection cuts for nonlinear integer programming: convexification techniques for structured sets , 2013, Mathematical Programming.
[23] Kent Andersen,et al. Intersection Cuts for Mixed Integer Conic Quadratic Sets , 2013, IPCO.
[24] Alper Atamtürk,et al. Lifting for conic mixed-integer programming , 2011, Math. Program..
[25] 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 .
[26] Hanif D. Sherali,et al. Disjunctive Programming , 2009, Encyclopedia of Optimization.
[27] Nikolaos V. Sahinidis,et al. Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming , 2002 .
[28] Sanjay Mehrotra,et al. Generating Convex Polynomial Inequalities for Mixed 0–1 Programs , 2002, J. Glob. Optim..
[29] Nikolaos V. Sahinidis,et al. Global optimization of mixed-integer nonlinear programs: A theoretical and computational study , 2004, Math. Program..
[30] Arkadi Nemirovski,et al. Robust Convex Optimization , 1998, Math. Oper. Res..
[31] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[32] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[33] Laurence A. Wolsey,et al. Sufficiency of cut-generating functions , 2015, Math. Program..
[34] Leon Hirsch,et al. Fundamentals Of Convex Analysis , 2016 .
[35] Gérard Cornuéjols,et al. Valid inequalities for mixed integer linear programs , 2007, Math. Program..
[36] Pierre Bonami,et al. Lift-and-Project Cuts for Mixed Integer Convex Programs , 2011, IPCO.
[37] Alper Atamtürk,et al. Conic mixed-integer rounding cuts , 2009, Math. Program..
[38] Daniel Bienstock,et al. Strong formulations for convex functions over nonconvex sets , 2012 .
[39] Hanif D. Sherali,et al. Optimization with disjunctive constraints , 1980 .
[40] Claudio Gentile,et al. Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints , 2006, Oper. Res..
[41] Gérard Cornuéjols,et al. On the facets of mixed integer programs with two integer variables and two constraints , 2008, Math. Program..
[42] Jean-Philippe Vial,et al. Robust Optimization , 2021, ICORES.
[43] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .
[44] James R. Luedtke,et al. Effective separation of disjunctive cuts for convex mixed integer nonlinear programs , 2010 .
[45] Gérard Cornuéjols,et al. Cut-Generating Functions and S-Free Sets , 2015, Math. Oper. Res..
[46] Jon Lee,et al. Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations , 2011, Math. Program..
[47] George L. Nemhauser,et al. A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs , 2008, INFORMS J. Comput..
[48] Sercan Yildiz,et al. Two-term disjunctions on the second-order cone , 2014, IPCO.
[49] Arkadi Nemirovski,et al. Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.
[50] Nikolaos V. Sahinidis,et al. A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..
[51] 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..
[52] Pietro Belotti,et al. On families of quadratic surfaces having fixed intersections with two hyperplanes , 2013, Discret. Appl. Math..
[53] Egon Balas,et al. Integer programming and convex analysis: Intersection cuts from outer polars , 1972, Math. Program..
[54] Martin J. Wainwright,et al. Sparse learning via Boolean relaxations , 2015, Mathematical Programming.
[55] Ellis L. Johnson. Characterization of facets for multiple right-hand choice linear programs , 1981 .
[56] G. Cornuéjols,et al. Corner Polyhedron and Intersection Cuts , 2011 .
[57] Levent Tunçel,et al. Clustering via minimum volume ellipsoids , 2007, Comput. Optim. Appl..
[58] Daniel Dadush,et al. The split closure of a strictly convex body , 2011, Oper. Res. Lett..
[59] Daniel Bienstock,et al. Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets , 2014, SIAM J. Optim..
[60] Ted K. Ralphs,et al. Integer and Combinatorial Optimization , 2013 .
[61] S. Ulbrich,et al. MIXED INTEGER SECOND ORDER CONE PROGRAMMING , 2008 .
[62] Jean B. Lasserre,et al. An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs , 2001, IPCO.
[63] Alper Atamtürk,et al. A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems , 2012, Oper. Res..
[64] Egon Balas,et al. Intersection cuts from multiple rows: a disjunctive programming approach , 2012, EURO J. Comput. Optim..
[65] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[66] N. Sahinidis,et al. Convexification and Global Optimization in Continuous And , 2002 .
[67] Stephen P. Boyd,et al. Portfolio optimization with linear and fixed transaction costs , 2007, Ann. Oper. Res..
[68] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra, II , 1972, Math. Program..
[69] Juan Pablo Vielma,et al. A Strong Dual for Conic Mixed-Integer Programs , 2012, SIAM J. Optim..
[70] Hanif D. Sherali,et al. A Complementarity-based Partitioning and Disjunctive Cut Algorithm for Mathematical Programming Problems with Equilibrium Constraints , 2006, J. Glob. Optim..
[71] Gérard Cornuéjols,et al. An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..
[72] Sanjay Mehrotra,et al. A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..
[73] Warren P. Adams,et al. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .
[74] Egon Balas,et al. Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..
[75] Ellis L. Johnson. On the group problem for mixed integer programming , 1974 .
[76] Alberto Caprara,et al. An effective branch-and-bound algorithm for convex quadratic integer programming , 2010, Math. Program..
[77] Roland Hildebrand. An LMI description for the cone of Lorentz-positive maps II , 2011 .
[78] Gerhard J. Woeginger,et al. Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings , 2011, IPCO.
[79] Jon Lee,et al. Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations , 2010, Math. Program..
[80] Laurence A. Wolsey,et al. Inequalities from Two Rows of a Simplex Tableau , 2007, IPCO.
[81] Duan Li,et al. Cardinality Constrained Linear-Quadratic Optimal Control , 2011, IEEE Transactions on Automatic Control.
[82] Gérard Cornuéjols,et al. Equivalence between intersection cuts and the corner polyhedron , 2010, Oper. Res. Lett..
[83] Samuel Burer,et al. How to convexify the intersection of a second order cone and a nonconvex quadratic , 2014, Math. Program..