LogMIP
From MaRDI portal
Cited in
(33)- MindtPy
- SCICONIC
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Solving linear optimization over arithmetic constraint formula
- Global optimization of disjunctive programs
- Lift-and-project cuts for convex mixed integer nonlinear programs
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- minlpBB
- Review of nonlinear mixed-integer and disjunctive programming techniques
- MacMINLP
- SYMBA
- NOA
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- CMU-IBM
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Generalized disjunctive programming: solution strategies
- Optimization modulo theories with linear rational costs
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- vZ
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- PyLMT
- CGM-Tool
- scientific article; zbMATH DE number 2085341 (Why is no real title available?)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- Solving planning and design problems in the process industry using mixed integer and global optimization
- A review of recent advances in global optimization
This page was built for software: LogMIP
