On branching rules for convex mixed-integer nonlinear optimization

DOI10.1145/2532568MaRDI QIDQ5178746zbMATH OpenOpenAlexFDO

Authors Pierre Bonami, Jon Lee, Sven Leyffer, 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

zbMATH Keywords

branch-and-boundmixed-integer nonlinear programmingstrong-branching

Mathematics Subject Classification ID

Approximation algorithms (68W25) Mixed integer programming (90C11) Nonlinear programming (90C30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
• Branching and bounds tighteningtechniques for non-convex MINLP
• Mixed-integer nonlinear optimization
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
• Branch and Bound Experiments in Convex Nonlinear Integer Programming

Cited in

(30)

• Some branch and bound techniques for nonlinear optimization
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
• Juniper: an open-source nonlinear branch-and-bound solver in Julia
• Virtuous smoothing for global optimization
• Polyhedral approximation in mixed-integer convex optimization
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
• On generalized surrogate duality in mixed-integer nonlinear programming
• An overview of MINLP algorithms and their implementation in Muriqui optimizer
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
• A partitioning algorithm for the mixed integer nonlinear programming problem
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization
• Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming
• Alternative branching rules for some nonconvex problems
• A probing algorithm for MINLP with failure prediction by SVM
• Branching and bounds tighteningtechniques for non-convex MINLP
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Mixed-integer nonlinear programs featuring ``on/off constraints
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• Strong-branching inequalities for convex mixed integer nonlinear programs
• Decomposition Branching for Mixed Integer Programming
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
• A Global Optimization Strategy and Its Use in Solvent Design
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming
• Learning for Spatial Branching: An Algorithm Selection Approach
• On cutting plane algorithms for nonlinear binary optimization
• Solving Euclidean max-sum problems exactly with cutting planes
• Integrality gap minimization heuristics for binary mixed integer nonlinear programming
• 50 years of mixed-integer nonlinear and disjunctive programming
• Minotaur: a mixed-integer nonlinear optimization toolkit

This page was built for publication: On branching rules for convex mixed-integer nonlinear optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178746)