Mixed integer nonlinear programming tools: a practical overview
From MaRDI portal
Publication:766256
Recommendations
Cites work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A branch-and-reduce approach to global optimization
- A feasibility pump for mixed integer nonlinear programs
- A storm of feasibility pumps for nonconvex MINLP
- A tree-search algorithm for mixed integer programming problems
- An algorithmic framework for convex mixed integer nonlinear programs
- An Automatic Method of Solving Discrete Programming Problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Application-oriented mixed integer non-linear programming
- BARON: A general purpose global optimization software package
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Conflict analysis in mixed integer programming
- CUTE
- Different transformations for solving non-convex trim-loss problems by MINLP
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Generalized Benders decomposition
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- MINTO, a Mixed INTeger Optimizer
- Pseudo-Convex Functions
- Reformulation and convex relaxation techniques for global optimization
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Rounding-based heuristics for nonconvex MINLPS
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Writing global optimization software
Cited in
(21)- Dual mean field search for large scale linear and quadratic knapsack problems
- Surveys in operations research
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- A class of valid inequalities for multilinear 0-1 optimization problems
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Compact quadratizations for pseudo-Boolean functions
- On relations between chance constrained and penalty function problems under discrete distributions
- Mixed integer nonlinear programming tools: an updated practical overview
- A note on solving MINLP's using formulation space search
- Twelve surveys in operations research
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Noncommercial software for mixed-integer linear programming
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
- Undecidability and hardness in mixed-integer nonlinear programming
- Overview on mixed integer nonlinear programming problems
- Applications of mathematical programming to genetic biocontrol
- Discrete level-bundle method for mean-CVaR portfolio optimization with cardinality constraint
- Still more surveys in operations research\dots
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- RENS. The optimal rounding
Describes a project that uses
Uses Software
This page was built for publication: Mixed integer nonlinear programming tools: a practical overview
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766256)
