Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming

DOI10.1007/S10898-014-0217-8MaRDI QIDQ486413zbMATH OpenOpenAlexFDO

Authors Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp

Publication date 15 January 2015

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-014-0217-8

zbMATH Keywords

hybrid algorithmouter approximationmixed integer nonlinear programmingbranch-and-bound

Mathematics Subject Classification ID

Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)

Recommendations

• Convex mixed integer nonlinear programming problems and an outer approximation algorithm
• Solving mixed integer nonlinear programs by outer approximation
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming
• A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
• An improved branch and bound algorithm for mixed integer nonlinear programs
• An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
• Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
• Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
• On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition

Cites work

• A branch-and-cut method for 0-1 mixed convex programming
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• An Automatic Method of Solving Discrete Programming Problems
• An algorithm for nonlinear optimization problems with binary variables
• An algorithmic framework for convex mixed integer nonlinear programs
• An improved branch and bound algorithm for mixed integer nonlinear programs
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Generalized Benders decomposition
• Generalized convex disjunctive programming: Nonlinear convex hull relaxation
• Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
• Heuristics for convex mixed integer nonlinear programs
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Solving convex MINLP optimization problems using a sequential cutting plane algorithm

Cited in

(21)

• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
• An overview of MINLP algorithms and their implementation in Muriqui optimizer
• Two linear approximation algorithms for convex mixed integer nonlinear programming
• FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming
• An algorithmic framework for convex mixed integer nonlinear programs
• On branching rules for convex mixed-integer nonlinear optimization
• An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
• Solving mixed integer nonlinear programs by outer approximation
• Integrality gap minimization heuristics for binary mixed integer nonlinear programming
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
• Using regularization and second order information in outer approximation for convex MINLP
• A dynamic convexized method for nonconvex mixed integer nonlinear programming
• A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space
• An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems
• Algorithm for solution of convex MINLP problems
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
• The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
• An outer approximation method for a class of minimax convex MINLP problems
• An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space

Describes a project that uses

Uses Software

• CMU-IBM
• Bonmin

This page was built for publication: Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming

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