Perspective reformulations of mixed integer nonlinear programs with indicator variables
暂无分享,去创建一个
[1] R. Boorstyn,et al. Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..
[2] Aharon Ben-Tal,et al. Lectures on modern convex optimization , 1987 .
[3] Sinan Gürel,et al. A strong conic quadratic reformulation for machine-job assignment with controllable processing times , 2009, Oper. Res. Lett..
[4] R. Gomory. AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .
[5] Lorenz T. Biegler,et al. On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..
[6] I. Grossmann,et al. An LP/NLP based branch and bound algorithm for convex MINLP optimization problems , 1992 .
[7] Oktay Günlük,et al. Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..
[8] Leo Liberti,et al. Introduction to Global Optimization , 2006 .
[9] Claudio Gentile,et al. Perspective cuts for a class of convex 0–1 mixed integer programs , 2006, Math. Program..
[10] Sanjay Mehrotra,et al. A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..
[11] John E. Mitchell,et al. An improved branch and bound algorithm for mixed integer nonlinear programs , 1994, Comput. Oper. Res..
[12] Oktay Günlük,et al. Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables , 2008, IPCO.
[13] Jeff T. Linderoth,et al. FilMINT: An Outer-Approximation-Based Solver for Nonlinear Mixed Integer Programs , 2008 .
[14] Claudio Gentile,et al. SDP diagonalizations and perspective cuts for a class of nonseparable MIQP , 2007, Oper. Res. Lett..
[15] Daniel Bienstock,et al. Computational Study of a Family of Mixed-Integer Quadratic Programming Problems , 1995, IPCO.
[16] Sebastián Ceria,et al. Convex programming for disjunctive convex optimization , 1999, Math. Program..
[17] Ignacio E. Grossmann,et al. Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation , 2003, Comput. Optim. Appl..
[18] Laurence A. Wolsey,et al. A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..
[19] Jon Lee,et al. Mixed-integer nonlinear programming: Some modeling and solution issues , 2007, IBM J. Res. Dev..
[20] Ignacio E. Grossmann,et al. Computational experience with dicopt solving MINLP problems in process systems engineering , 1989 .
[21] Arkadi Nemirovski,et al. Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.
[22] Jos F. Sturm,et al. A Matlab toolbox for optimization over symmetric cones , 1999 .
[23] G. Mitra,et al. Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints , 2001 .
[24] Nikolaos V. Sahinidis,et al. Global optimization of mixed-integer nonlinear programs: A theoretical and computational study , 2004, Math. Program..
[25] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[26] Thomas L. Magnanti,et al. Shortest paths, single origin-destination network design, and associated polyhedra , 1993, Networks.
[27] Gérard Cornuéjols,et al. An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..
[28] Oktay Günlük,et al. IBM Research Report MINLP Strengthening for Separable Convex Quadratic Transportation-Cost UFL , 2007 .
[29] Alper Atamtürk,et al. Conic mixed-integer rounding cuts , 2009, Math. Program..
[30] André F. Perold,et al. Large-Scale Portfolio Optimization , 1984 .
[31] Mehmet Tolga Çezik,et al. Cuts for mixed 0-1 conic programming , 2005, Math. Program..
[32] Dimitri P. Bertsekas,et al. Data Networks , 1986 .