scientific article; zbMATH DE number 2068060
From MaRDI portal
Publication:4464667
Recommendations
- An algorithmic framework for MINLP with separable non-convexity
- scientific article; zbMATH DE number 1054667
- An outer approximation method for a class of minimax convex MINLP problems
- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
- Mixed-integer nonlinear optimization
Cited in
(6)- A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Inexact solution of NLP subproblems in MINLP
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP
- A review of recent advances in global optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4464667)
