An overview of MINLP algorithms and their implementation in Muriqui optimizer
From MaRDI portal
Recommendations
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Algorithms, softwares and recent developments of mixed integer nonlinear programming
- An algorithmic framework for convex mixed integer nonlinear programs
- Mixed-integer nonlinear optimization
- Minotaur: a mixed-integer nonlinear optimization toolkit
Cites work
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- A branch-and-cut method for 0-1 mixed convex programming
- A feasibility pump for mixed integer nonlinear programs
- A sequential cutting plane algorithm for solving convex NLP problems
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space
- Algorithms and Software 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
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- Generalized Benders decomposition
- Heuristics for convex mixed integer nonlinear programs
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- Mixed integer nonlinear programming tools: a practical overview
- Nonlinear integer programming
- On branching rules for convex mixed-integer nonlinear optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- RENS. The optimal rounding
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Solving mixed integer nonlinear programs by outer approximation
- The Supporting Hyperplane Method for Unimodal Programming
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
Cited in
(10)- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- On cutting plane algorithms for nonlinear binary optimization
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- 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
- A disjunctive cut strengthening technique for convex MINLP
- Muriqui
- Convex relaxation for the generalized maximum-entropy sampling problem
- Mathematical optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)
Describes a project that uses
Uses Software
This page was built for publication: An overview of MINLP algorithms and their implementation in Muriqui optimizer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178345)
