Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
type: Item
instance of: scholarly article
title: Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
zbMATH Open document ID: 1312.90046
author: Wendel Melo
author: Marcia Fampa
author: Fernanda M. P. Raupp
published in: Journal of Global Optimization
publication date: 2015-01-15T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6387001
zbMATH Keywords: mixed integer nonlinear programming
zbMATH Keywords: branch-and-bound
zbMATH Keywords: outer approximation
zbMATH Keywords: hybrid algorithm
describes a project that uses: Bonmin
describes a project that uses: CMU-IBM
MaRDI profile type: Publication
full work available at URL: s10898-014-0217-8
OpenAlex ID: W2073239458
cites work: A branch-and-cut method for 0-1 mixed convex programming
cites work: An algorithmic framework for convex mixed integer nonlinear programs
cites work: Heuristics for convex mixed integer nonlinear programs
cites work: Algorithms and Software for Convex Mixed Integer Nonlinear Programs
cites work: An improved branch and bound algorithm for mixed integer nonlinear programs
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: Generalized Benders decomposition
cites work: Review of nonlinear mixed-integer and disjunctive programming techniques
cites work: Generalized convex disjunctive programming: Nonlinear convex hull relaxation
cites work: Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization
cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: Integrating SQP and branch-and-bound for mixed integer nonlinear programming
cites work: An algorithm for nonlinear optimization problems with binary variables
cites work: Solving convex MINLP optimization problems using a sequential cutting plane algorithm
DOI: 10.1007/S10898-014-0217-8
Recommended article: Convex mixed integer nonlinear programming problems and an outer approximation algorithm
Recommended article: Solving mixed integer nonlinear programs by outer approximation
Recommended article: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Recommended article: Integrating SQP and branch-and-bound for mixed integer nonlinear programming
Recommended article: A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
Recommended article: An improved branch and bound algorithm for mixed integer nonlinear programs
Recommended article: An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
Recommended article: Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming
Recommended article: Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
Recommended article: On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
description: scientific article; zbMATH DE number 6387001