LogMIP

swMATH5035MaRDI QIDQ17175

No author found.

Related Items (23)

Algorithms and Software for Convex Mixed Integer Nonlinear Programs ⋮ Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization ⋮ Pyomo.GDP: an ecosystem for logic based modeling and optimization development ⋮ A review of recent advances in global optimization ⋮ Relaxation and decomposition methods for mixed integer nonlinear programming. ⋮ Generalized Disjunctive Programming: Solution Strategies ⋮ Solving linear optimization over arithmetic constraint formula ⋮ Global optimization of disjunctive programs ⋮ Optimization Modulo Theories with Linear Rational Costs ⋮ Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach ⋮ Lift-and-project cuts for convex mixed integer nonlinear programs ⋮ Unnamed Item ⋮ An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs ⋮ Generalized convex disjunctive programming: Nonlinear convex hull relaxation ⋮ An improved Bernstein global optimization algorithm for MINLP problems with application in process industry ⋮ Strong-branching inequalities for convex mixed integer nonlinear programs ⋮ An interleaved depth-first search method for the linear optimization problem with disjunctive constraints ⋮ Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation ⋮ Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming ⋮ \textsc{OptiMathSAT}: a tool for optimization modulo theories ⋮ Review of nonlinear mixed-integer and disjunctive programming techniques ⋮ 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

This page was built for software: LogMIP