scientific article; zbMATH DE number 1101647
From MaRDI portal
Publication:4371068
zbMath0884.65058MaRDI QIDQ4371068
Zdravko Kravanja, Ignacio E. Grossmann
Publication date: 12 March 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
bibliographydisjunctive programmingbranch and bound methodmixed-integer nonlinear programmingprocess optimizationnonlinear discrete optimizationouter-approximationprocess synthesisextended cutting plane methodsgeneralized benders methods
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Nonlinear programming (90C30)
Related Items
Minotaur: a mixed-integer nonlinear optimization toolkit, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, Inversion of convection-diffusion equation with discrete sources, Tight convex relaxations for the expansion planning problem, SUSPECT: MINLP special structure detector for Pyomo, A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization, Box-constrained quadratic programs with fixed charge variables, Optimization methods for mixed integer weakly concave programming problems, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, A trust region SQP algorithm for mixed-integer nonlinear programming, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests, The oracle penalty method, Reformulations for utilizing separability when solving convex MINLP problems, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, Improving the performance of DICOPT in convex MINLP problems using a feasibility pump, Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs
