Algorithms and Software for Convex Mixed Integer Nonlinear Programs
暂无分享,去创建一个
[1] A. Land,et al. An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.
[2] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[3] R. Gomory. AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .
[4] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems , 1962 .
[5] R. J. Dakin,et al. A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..
[6] Egon Balas,et al. Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..
[7] G. Ribiere,et al. Experiments in mixed-integer linear programming , 1971, Math. Program..
[8] G. Nemhauser,et al. Integer Programming , 2020 .
[9] Robert G. Jeroslow,et al. There Cannot be any Algorithm for Integer Programming with Quadratic Constraints , 1973, Oper. Res..
[10] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..
[11] John J. H. Forrest,et al. Practical Solution of Large Mixed Integer Programming Problems with Umpire , 1974 .
[12] R. Boorstyn,et al. Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..
[13] E.M.L. Beale,et al. Branch and Bound Methods for Mathematical Programming Systems , 1977 .
[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[15] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[16] R. McBride,et al. An Implicit Enumeration Algorithm for Quadratic Integer Programming , 1980 .
[17] Omprakash K. Gupta,et al. Branch and Bound Experiments in Convex Nonlinear Integer Programming , 1985 .
[18] Aharon Ben-Tal,et al. Lectures on modern convex optimization , 1987 .
[19] Katta G. Murty,et al. Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..
[20] I. Grossmann,et al. Relaxation strategy for the structural optimization of process flow sheets , 1987 .
[21] Ignacio E. Grossmann,et al. An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1987, Math. Program..
[22] M. D. Wilkinson,et al. Management science , 1989, British Dental Journal.
[23] I. Grossmann,et al. A combined penalty function and outer-approximation method for MINLP optimization : applications to distillation column design , 1989 .
[24] I. Grossmann,et al. An LP/NLP based branch and bound algorithm for convex MINLP optimization problems , 1992 .
[25] Sven Leyffer,et al. Deterministic Methods for Mixed Integer Nonlinear Programming , 1993 .
[26] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[27] Jonathan Eckstein,et al. Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5 , 1994, SIAM J. Optim..
[28] Sven Leyffer,et al. Solving mixed integer nonlinear programs by outer approximation , 1994, Math. Program..
[29] Martin W. P. Savelsbergh,et al. MINTO, a mixed INTeger optimizer , 1994, Oper. Res. Lett..
[30] John E. Mitchell,et al. An improved branch and bound algorithm for mixed integer nonlinear programs , 1994, Comput. Oper. Res..
[31] Arne Stolbjerg Drud,et al. CONOPT - A Large-Scale GRG Code , 1994, INFORMS J. Comput..
[32] Daniel Bienstock,et al. Computational Study of a Family of Mixed-Integer Quadratic Programming Problems , 1995, IPCO.
[33] T. Westerlund,et al. An extended cutting plane method for solving convex MINLP problems , 1995 .
[34] I. Grossmann,et al. Logic-based MINLP algorithms for the optimal synthesis of process networks , 1996 .
[35] Egon Balas,et al. Gomory cuts revisited , 1996, Oper. Res. Lett..
[36] John E. Mitchell,et al. A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs , 1997, Comput. Oper. Res..
[37] Ignacio E. Grossmann,et al. LOGMIP: a disjunctive 0–1 nonlinear optimizer for process systems models , 1997 .
[38] Iiro Harjunkoski,et al. An extended cutting plane method for a class of non-convex MINLP problems , 1998 .
[39] R. Bixby,et al. On the Solution of Traveling Salesman Problems , 1998 .
[40] David W.T. Rippin,et al. Optimal design of a multi-product batch plant , 1998 .
[41] Martin W. P. Savelsbergh,et al. A Computational Study of Search Strategies for Mixed Integer Programming , 1999, INFORMS J. Comput..
[42] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[43] Sanjay Mehrotra,et al. A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..
[44] R. Vanderbei. LOQO:an interior point code for quadratic programming , 1999 .
[45] Tapio Westerlund,et al. A cutting plane method for minimizing pseudo-convex functions in the mixed integer case , 2000 .
[46] Arkadi Nemirovski,et al. Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.
[47] Sven Leyffer,et al. Integrating SQP and Branch-and-Bound for Mixed Integer Nonlinear Programming , 2001, Comput. Optim. Appl..
[48] I. Maros,et al. An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems , 2001 .
[49] G. Mitra,et al. Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints , 2001 .
[50] D K Smith,et al. Numerical Optimization , 2001, J. Oper. Res. Soc..
[51] Laurence A. Wolsey,et al. Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..
[52] Jorge J. Moré,et al. Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .
[53] Egon Balas,et al. Lift-and-project for Mixed 0-1 programming: recent progress , 2002, Discret. Appl. Math..
[54] Michael A. Saunders,et al. SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2002, SIAM J. Optim..
[55] Matteo Fischetti,et al. Local branching , 2003, Math. Program..
[56] François Margot,et al. Exploiting orbits in symmetric ILP , 2003, Math. Program..
[57] Michael R. Bussieck,et al. MINLPLib - A Collection of Test Models for Mixed-Integer Nonlinear Programming , 2003, INFORMS J. Comput..
[58] Jacques F. Benders,et al. Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..
[59] Mehmet Tolga Çezik,et al. Cuts for mixed 0-1 conic programming , 2005, Math. Program..
[60] Fred W. Glover,et al. The feasibility pump , 2005, Math. Program..
[61] Ted K. Ralphs,et al. Noncommercial Software for Mixed-Integer Linear Programming , 2005 .
[62] Lorenz T. Biegler,et al. A Mixed Integer Approach for Obtaining Unique Solutions in Source Inversion of Drinking Water Networks , 2005 .
[63] Claude Le Pape,et al. Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..
[64] Tapio Westerlund,et al. Optimization of block layout design problems with unequal areas: A comparison of MILP and MINLP optimization methods , 2005, Comput. Chem. Eng..
[65] Thorsten Koch,et al. Branching rules revisited , 2005, Oper. Res. Lett..
[66] Sanjay J. Patel,et al. Continuous Optimization , 2005, ISCA 2005.
[67] Jeff Linderoth,et al. Noncommercial Software for Mixed-Integer Linear Programming , 2005 .
[68] Lorenz T. Biegler,et al. On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..
[69] T. Kuno,et al. A Disjunctive Cutting-Plane-Based Branch-and-Cut Algorithm for 0−1 Mixed-Integer Convex Nonlinear Programs , 2006 .
[70] Heidi Nelson,et al. Coin of the Realm , 2006, Annals of Surgical Oncology.
[71] Jorge Nocedal,et al. Knitro: An Integrated Package for Nonlinear Optimization , 2006 .
[72] Samir Elhedhli,et al. Service System Design with Immobile Servers, Stochastic Demand, and Congestion , 2006, Manuf. Serv. Oper. Manag..
[73] Timo Berthold. Primal Heuristics for Mixed Integer Programs , 2006 .
[74] Lorenz T. Biegler,et al. Mixed-Integer Approach for Obtaining Unique Solutions in Source Inversion of Water Networks , 2006 .
[75] 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..
[76] Katta G. Murty,et al. Nonlinear Programming Theory and Algorithms , 2007, Technometrics.
[77] Timo Berthold,et al. Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Improving the Feasibility Pump Improving the Feasibility Pump , 2022 .
[78] Ana M. Eliceche,et al. Environmental life cycle impact as a tool for process optimisation of a utility plant , 2007, Comput. Chem. Eng..
[79] Matteo Fischetti,et al. A feasibility pump heuristic for general mixed-integer problems , 2007, Discret. Optim..
[80] Oktay Günlük,et al. IBM Research Report MINLP Strengthening for Separable Convex Quadratic Transportation-Cost UFL , 2007 .
[81] Antonio Flores-Tlacuahuac,et al. Simultaneous mixed-integer dynamic optimization for integrated design and control , 2007, Comput. Chem. Eng..
[82] Leo Liberti. Reformulations in Mathematical Programming: Symmetry , 2008 .
[83] Jeff T. Linderoth,et al. FilMINT: An Outer-Approximation-Based Solver for Nonlinear Mixed Integer Programs , 2008 .
[84] S. Ulbrich,et al. MIXED INTEGER SECOND ORDER CONE PROGRAMMING , 2008 .
[85] Miguel A. Lejeune. A Unified Approach for Cycle Service Levels , 2008 .
[86] Gérard Cornuéjols,et al. An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..
[87] Matteo Fischetti,et al. Feasibility pump 2.0 , 2009, Math. Program. Comput..
[88] Gérard Cornuéjols,et al. A Feasibility Pump for mixed integer nonlinear programs , 2009, Math. Program..
[89] Iiro Harjunkoski,et al. MINLP: Trim-loss Problem , 2009, Encyclopedia of Optimization.
[90] Tobias Achterberg,et al. SCIP: solving constraint integer programs , 2009, Math. Program. Comput..
[91] Christodoulos A. Floudas. Generalized Benders Decomposition , 2009, Encyclopedia of Optimization.
[92] Hanif D. Sherali,et al. Disjunctive Programming , 2009, Encyclopedia of Optimization.
[93] Timo Berthold,et al. A primal heuristic for MINLP based on sub-MIPs generated by set covering , 2009 .
[94] Sven Leyffer,et al. FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs , 2010, INFORMS J. Comput..
[95] M. Jünger,et al. 50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art , 2010 .
[96] Ailsa H. Land,et al. An Automatic Method of Solving Discrete Programming Problems , 1960 .
[97] 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.
[98] Alper Atamtürk,et al. Conic mixed-integer rounding cuts , 2009, Math. Program..
[99] Gérard Cornuéjols,et al. Polyhedral Approaches to Mixed Integer Linear Programming , 2010, 50 Years of Integer Programming.
[100] Gerhard J. Woeginger,et al. Operations Research Letters , 2011 .
[101] Jeff T. Linderoth,et al. Orbital branching , 2007, Math. Program..
[102] Gérard Cornuéjols,et al. Branching on general disjunctions , 2011, Math. Program..
[103] Gérard Cornuéjols,et al. Improved strategies for branching on general disjunctions , 2011, Math. Program..
[104] Leo Liberti,et al. Symmetry in Mathematical Programming , 2012 .
[105] Pierre Bonami,et al. Heuristics for convex mixed integer nonlinear programs , 2012, Comput. Optim. Appl..
[106] Ted K. Ralphs,et al. Integer and Combinatorial Optimization , 2013 .
[107] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.