LogMIP

swMATH5035MaRDI QIDQ17175FDOQ17175

Author name not available (Why is that?)

Cited In (23)

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

This page was built for software: LogMIP