A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
From MaRDI portal
Publication:3639239
DOI10.1007/978-3-642-04128-0_10zbMath1256.90037OpenAlexW1486559098MaRDI QIDQ3639239
Jon Lee, Andreas Wächter, Claudia D'Ambrosio
Publication date: 29 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04128-0_10
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items (4)
An Algorithmic Framework for MINLP with Separable Non-Convexity ⋮ Application-oriented mixed integer non-linear programming ⋮ Heuristic algorithms for the general nonlinear separable knapsack problem ⋮ Strengthening the sequential convex MINLP technique by perspective reformulations
Uses Software
This page was built for publication: A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
