Mixed integer nonlinear programming tools: a practical overview
From MaRDI portal
Publication:766256
DOI10.1007/s10288-011-0181-9zbMath1235.90101OpenAlexW1983007923MaRDI QIDQ766256
Claudia D'Ambrosio, Andrea Lodi
Publication date: 23 March 2012
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-011-0181-9
Related Items
Dual mean field search for large scale linear and quadratic knapsack problems, Twelve surveys in operations research, On relations between chance constrained and penalty function problems under discrete distributions, Mixed integer nonlinear programming tools: an updated practical overview, An overview of MINLP algorithms and their implementation in Muriqui optimizer, Two linear approximation algorithms for convex mixed integer nonlinear programming, A note on solving MINLP's using formulation space search, 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, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, RENS. The optimal rounding, Compact quadratizations for pseudo-Boolean functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Application-oriented mixed integer non-linear programming
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- Different transformations for solving non-convex trim-loss problems by MINLP
- MINTO, a Mixed INTeger Optimizer
- Rounding-based heuristics for nonconvex MINLPS
- Reformulation and convex relaxation techniques for global optimization
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A branch-and-reduce approach to global optimization
- BARON: A general purpose global optimization software package
- A storm of feasibility pumps for nonconvex MINLP
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Conflict analysis in mixed integer programming
- Generalized Benders decomposition
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- An Automatic Method of Solving Discrete Programming Problems
- Branching and bounds tighteningtechniques for non-convex MINLP
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- CUTE
- Pseudo-Convex Functions
- A tree-search algorithm for mixed integer programming problems
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
