The following pages link to LogMIP (Q17175):
Displaying 12 items.
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (Q411431) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- Solving planning and design problems in the process industry using mixed integer and global optimization (Q817211) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation (Q1410241) (← links)
- Solving linear optimization over arithmetic constraint formula (Q1675635) (← links)
- Global optimization of disjunctive programs (Q1679482) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints (Q1753130) (← links)
- Review of nonlinear mixed-integer and disjunctive programming techniques (Q1863893) (← links)
