Deterministic Methods for Mixed Integer Nonlinear Programming

[1]  Sven Leyffer,et al.  Solving mixed integer nonlinear programs by outer approximation , 1994, Math. Program..

[2]  R. Fletcher,et al.  Resolving degeneracy in quadratic programming , 1993, Ann. Oper. Res..

[3]  Alexander H. G. Rinnooy Kan,et al.  Decomposition in general mathematical programming , 1993, Math. Program..

[4]  M. Tamiz,et al.  Stability, Duality and Decomposition in General Mathematical Programming , 1993 .

[5]  John M. Wilson.  Model Solving in Mathematical Programming , 1993 .

[6]  H. Paul Williams,et al.  Model solving in mathematical programming , 1993 .

[7]  I. Grossmann,et al.  An LP/NLP based branch and bound algorithm for convex MINLP optimization problems , 1992 .

[8]  Han-Lin Li,et al.  An approximate method for local optima for nonlinear mixed integer programming problems , 1992, Comput. Oper. Res..

[9]  Jochem Zowe,et al.  A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..

[10]  Ignacio E. Grossmann,et al.  Mixed-integer linear programming reformulations for some nonlinear discrete design optimization problems , 1992 .

[11]  J. W. Kwiatkowski.  Algorithms for index tracking , 1992 .

[12]  Romualdo Salcedo,et al.  Solving nonconvex nonlinear programming and mixed-integer nonlinear programming problems with adaptive random search , 1992 .

[13]  Nelson Maculan,et al.  Lagrangean decomposition for integer nonlinear programming with linear constraints , 1991, Math. Program..

[14]  Han Tong Loh,et al.  Computational Implementation and Tests of a Sequential Linearization Algorithm for Mixed-Discrete Nonlinear Design Optimization , 1991 .

[15]  H. Loh,et al.  A Sequential Linearization Approach for Solving Mixed-Discrete Nonlinear Design Optimization Problems , 1991 .

[16]  I. Grossmann,et al.  Convergence properties of generalized benders decomposition , 1991 .

[17]  Martin Grötschel,et al.  Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

[18]  Michael Werman,et al.  The relationship between integer and real solutions of constrained convex programming , 1991, Math. Program..

[19]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[20]  Francisco E. Torres.  Linearization of mixed-integer products , 1991, Math. Program..

[21]  I. Grossmann,et al.  A combined penalty function and outer-approximation method for MINLP optimization : applications to distillation column design , 1989 .

[22]  E. Sandgren,et al.  Nonlinear Integer and Discrete Programming for Topological Decision Making in Engineering Design , 1990 .

[23]  Alexander H. G. Rinnooy Kan,et al.  A note on benders decomposition in mixed-integer quadratic programming , 1990 .

[24]  Panos Y. Papalambros,et al.  Solution of mixed-discrete structural optimization problems with a new sequential linearization algorithm , 1990 .

[25]  G. Vanderplaats,et al.  Method for nonlinear optimization with discrete design variables , 1989 .

[26]  H. Amir,et al.  Nonlinear Mixed-Discrete Structural Optimization , 1989 .

[27]  Ignacio E. Grossmann,et al.  Computational experience with dicopt solving MINLP problems in process systems engineering , 1989 .

[28]  R. W. Mayne,et al.  Optimization With Discrete Variables Via Recursive Quadratic Programming: Part 2—Algorithm and Results , 1989 .

[29]  R. W. Mayne,et al.  Optimization With Discrete Variables Via Recursive Quadratic Programming: Part 1—Concepts and Definitions , 1989 .

[30]  Prabhat Hajela,et al.  Optimal design of laminated composites using a modified mixed integer and discrete programming algorithm , 1989 .

[31]  J. Stoer.  Numerische Mathematik 1 , 1989 .

[32]  E. Sandgren,et al.  Nonlinear Integer and Discrete Programming in Mechanical Design Optimization , 1990 .

[33]  I. Grossmann,et al.  Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesis , 1988 .

[34]  F. Körner.  A new branching rule for the branch and bound algorithm for solving nonlinear integer programming problems , 1988 .

[35]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[36]  X. Yuan,et al.  Une méthode d'optimisation non linéaire en variables mixtes pour la conception de procédés , 1988 .

[37]  Monique Guignard-Spielberg,et al.  Lagrangean decomposition: A model yielding stronger lagrangean bounds , 1987, Math. Program..

[38]  Panos M. Pardalos,et al.  Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

[39]  Ignacio E. Grossmann,et al.  An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1987, Math. Program..

[40]  V. A. Roshchin,et al.  Models and methods of solution of quadratic integer programming problems , 1987 .

[41]  H. Tuy.  Global Minimization of a Difference of Two Convex Functions , 1987 .

[42]  Michael A. Saunders,et al.  On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..

[43]  Omprakash K. Gupta,et al.  Branch and Bound Experiments in Convex Nonlinear Integer Programming , 1985 .

[44]  Rafael Lazimy,et al.  Improved algorithm for mixed-integer quadratic programs and a computational study , 1985, Math. Program..

[45]  Frank Körner,et al.  Integer quadratic optimization , 1985 .

[46]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[47]  Egon Balas,et al.  Nonlinear 0–1 programming: I. Linearization techniques , 1984, Math. Program..

[48]  Egon Balas,et al.  Nonlinear 0–1 programming: II. Dominance relations and algorithms , 1983, Math. Program..

[49]  Donald Goldfarb,et al.  A numerically stable dual method for solving strictly convex quadratic programs , 1983, Math. Program..

[50]  Omprakash K. Gupta,et al.  Nonlinear Integer Programming and Discrete Optimization , 1983 .

[51]  Tony J. Van Roy,et al.  Cross decomposition for mixed integer programming , 1983, Math. Program..

[52]  Rafael Lazimy,et al.  Mixed-integer quadratic programming , 1982, Math. Program..

[53]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[54]  Klaus Schittkowski,et al.  Test examples for nonlinear programming codes , 1980 .

[55]  F. Glover.  IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS , 1975 .

[56]  Hamdy A. Taha,et al.  Integer Programming: Theory, Applications, and Computations , 1975 .

[57]  Fred Glover,et al.  PITFALLS OF ROUNDING IN DISCRETE MANAGEMENT DECISION PROBLEMS , 1975 .

[58]  Robert G. Jeroslow,et al.  Trivial integer programs unsolvable by branch-and-bound , 1974, Math. Program..

[59]  Raymond Breu,et al.  Branch and bound experiments in zero-one programming , 1974 .

[60]  J. Asaadi,et al.  A computational comparison of some non-linear programs , 1973, Math. Program..

[61]  Robert G. Jeroslow,et al.  There Cannot be any Algorithm for Integer Programming with Quadratic Constraints , 1973, Oper. Res..

[62]  G. Nemhauser,et al.  Integer Programming , 2020 .

[63]  G. Ribiere,et al.  Experiments in mixed-integer linear programming , 1971, Math. Program..

[64]  A. M. Geoffrion.  Duality in Nonlinear Programming: A Simplified Applications-Oriented Development , 1971 .

[65]  R. J. Dakin,et al.  A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..

[66]  J. B. Rosen,et al.  Construction of nonlinear programming test problems , 1965 .

[67]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .