Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
From MaRDI portal
Publication:486413
DOI10.1007/s10898-014-0217-8zbMath1312.90046OpenAlexW2073239458MaRDI QIDQ486413
Wendel Melo, Fernanda M. P. Raupp, Márcia H. C. Fampa
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
Convex programming (90C25) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space ⋮ An overview of MINLP algorithms and their implementation in Muriqui optimizer ⋮ Two linear approximation algorithms for convex mixed integer nonlinear programming ⋮ Integrality gap minimization heuristics for binary mixed integer nonlinear programming ⋮ An overview of exact algorithms for the Euclidean Steiner tree problem inn-space
Uses Software
Cites Work
- Heuristics for convex mixed integer nonlinear programs
- 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
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Review of nonlinear mixed-integer and disjunctive programming techniques
- A branch-and-cut method for 0-1 mixed convex programming
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Generalized Benders decomposition
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization
- An Automatic Method of Solving Discrete Programming Problems
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming