scientific article; zbMATH DE number 1054663
From MaRDI portal
Publication:4352203
Recommendations
Cited in
(10)- Algorithm for solving NLP problems with the use of a modified Lagrange function
- Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
- A Sequential Linear Constraint Programming Algorithm for NLP
- On the Performance of NLP Solvers Within Global MINLP Solvers
- Improve-and-branch algorithm for the global optimization of nonconvex NLP problems
- Some branch and bound techniques for nonlinear optimization
- Guided dive for the spatial branch-and-bound
- scientific article; zbMATH DE number 1078157 (Why is no real title available?)
- Domain reduction techniques for global NLP and MINLP optimization
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
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 Q4352203)