On branching rules for convex mixed-integer nonlinear optimization
From MaRDI portal
Publication:5178746
DOI10.1145/2532568zbMath1322.90052OpenAlexW2034482866MaRDI QIDQ5178746
Sven Leyffer, Pierre Bonami, Jon Lee, Andreas Wächter
Publication date: 16 March 2015
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2532568
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items
Minotaur: a mixed-integer nonlinear optimization toolkit, An overview of MINLP algorithms and their implementation in Muriqui optimizer, Virtuous smoothing for global optimization, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, Polyhedral approximation in mixed-integer convex optimization, Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming