A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
DOI10.1007/978-3-642-04128-0_10zbMATH Open1256.90037OpenAlexW1486559098MaRDI QIDQ3639239FDOQ3639239
Authors: Claudia D'Ambrosio, Jon Lee, Andreas Wächter 
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
Recommendations
- An algorithmic framework for MINLP with separable non-convexity
- scientific article; zbMATH DE number 1054667
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- Handling separable non-convexities using disjunctive cuts
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cited In (16)
- Title not available (Why is that?)
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- A global optimization method for nonconvex separable programming problems
- An application of the nonuniform covering method to the global optimization of mixed integer nonlinear problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Handling separable non-convexities using disjunctive cuts
- Application-oriented mixed integer non-linear programming
- Title not available (Why is that?)
- Strengthening the sequential convex MINLP technique by perspective reformulations
- Heuristic algorithms for the general nonlinear separable knapsack problem
- An algorithmic framework for MINLP with separable non-convexity
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
Uses Software
This page was built for publication: A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3639239)
