MINLPB4 solves mixed-integer nonlinear programming problems by a branch-and-bound method, where the nodes of the search tree consist either of mixed-integer or of continuous optimization problems differing only by modified bounds. These subproblems are solved by the sequential quadratic programming code MISQP in both situations.
Keywords for this software
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Exler, Oliver; Lehmann, Thomas; Schittkowski, Klaus: A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (2012)
- Schlüter, Martin; Gerdts, Matthias; Rückmann, Jan-J.: A numerical study of MIDACO on 100 MINLP benchmarks (2012)