Bonmin
An algorithmic framework for convex mixed integer nonlinear programs. This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software for solving large-scale problems. Moreover, both fundamental building blocks, namely mixed integer linear programming and nonlinear programming, have seen considerable and steady progress in recent years. Wishing to exploit expertise in these areas as well as on previous work in mixed integer nonlinear programming, this work represents the first step in an ongoing and ambitious project within an open-source environment. COIN-OR is our chosen environment for the development of the optimization software. A class of hybrid algorithms, of which branch-and-bound and polyhedral outer approximation are the two extreme cases, are proposed and implemented. Computational results that demonstrate the effectiveness of this framework are reported. Both the library of mixed integer nonlinear problems that exhibit convex continuous relaxations, on which the experiments are carried out, and a version of the software used are publicly available.
Keywords for this software
References in zbMATH (referenced in 106 articles )
Showing results 1 to 20 of 106.
Sorted by year (- Buchheim, Christoph; De Santis, Marianna; Lucidi, Stefano; Rinaldi, Francesco; Trieu, Long: A feasible active set method with reoptimization for convex quadratic mixed-integer programming (2016)
- Fampa, Marcia; Lee, Jon; Melo, Wendel: A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in $n$-space (2016)
- Gassmann, Horand; Ma, Jun; Martin, Kipp: Communication protocols for options and results in a distributed optimization environment (2016)
- Grimstad, Bjarne; Sandnes, Anders: Global optimization with spline constraints: a new branch-and-bound method based on B-splines (2016)
- Kılınç-Karzan, Fatma: On minimal valid inequalities for mixed integer conic programs (2016)
- Kronqvist, Jan; Lundell, Andreas; Westerlund, Tapio: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (2016)
- Sharma, Shaurya; Knudsen, Brage Rugstad; Grimstad, Bjarne: Towards an objective feasibility pump for convex minlps (2016)
- Boland, N.L.; Eberhard, A.C.: On the augmented Lagrangian dual for integer programming (2015)
- Fernández, F.J.; Alvarez-Vázquez, L.J.; García-Chan, N.; Martínez, A.; Vázquez-Méndez, M.E.: Optimal location of green zones in metropolitan areas to control the urban heat island (2015)
- Ghaddar, Bissan; Naoum-Sawaya, Joe; Kishimoto, Akihiro; Taheri, Nicole; Eck, Bradley: A Lagrangian decomposition approach for the pump scheduling problem in water networks (2015)
- Humpola, Jesco; Fügenschuh, Armin; Lehmann, Thomas: A primal heuristic for optimizing the topology of gas networks based on dual information (2015)
- Kirst, Peter; Stein, Oliver; Steuermann, Paul: Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (2015)
- Mijangos, E.: An algorithm for two-stage stochastic mixed-integer nonlinear convex problems (2015)
- Wei, Zhou; Ali, M.Montaz: Convex mixed integer nonlinear programming problems and an outer approximation algorithm (2015)
- Wei, Zhou; Ali, M.Montaz: Generalized benders decomposition for one class of MINLPs with vector conic constraint (2015)
- Wei, Zhou; Montaz Ali, M.: Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability (2015)
- Aloise, Daniel; Hansen, Pierre; Rocha, Caroline; Santi, Éverton: Column generation bounds for numerical microaggregation (2014)
- Berthold, Timo: RENS. The optimal rounding (2014)
- Berthold, Timo; Gleixner, Ambros M.: Undercover: a primal MINLP heuristic exploring a largest sub-MIP (2014)
- Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie: A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (2014)