An overview of MINLP algorithms and their implementation in Muriqui optimizer
From MaRDI portal
Publication:2178345
DOI10.1007/s10479-018-2872-5zbMath1443.90256OpenAlexW2801755592MaRDI QIDQ2178345
Wendel Melo, Márcia H. C. Fampa, Fernanda M. P. Raupp
Publication date: 11 May 2020
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-018-2872-5
Convex programming (90C25) Mixed integer programming (90C11) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (7)
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT ⋮ A disjunctive cut strengthening technique for convex MINLP ⋮ A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm ⋮ The supporting hyperplane optimization toolkit for convex MINLP ⋮ Two linear approximation algorithms for convex mixed integer nonlinear programming ⋮ Muriqui ⋮ Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
Uses Software
Cites Work
- Unnamed Item
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
- Heuristics for convex mixed integer nonlinear programs
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- An algorithm for nonlinear optimization problems with binary variables
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- RENS. The optimal rounding
- Mixed integer nonlinear programming tools: a practical overview
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- A branch-and-cut method for 0-1 mixed convex programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A sequential cutting plane algorithm for solving convex NLP problems
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Generalized Benders decomposition
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Nonlinear Integer Programming
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- On branching rules for convex mixed-integer nonlinear optimization
- The Supporting Hyperplane Method for Unimodal Programming
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
This page was built for publication: An overview of MINLP algorithms and their implementation in Muriqui optimizer
