Extended Formulations for MINLP Problems by Value Decompositions (original) (raw)
Related papers
An algorithmic framework for convex mixed integer nonlinear programs
Discrete Optimization, 2008
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
Journal of Global Optimization, 2020
FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
2010
Valid inequalities and reformulation techniques for Mixed Integer Nonlinear Programming
2015
Computers & Operations Research, 1997
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Computers & Chemical Engineering, 2004
Application-Oriented Mixed Integer Non-Linear Programming
4
Decomposition Methods for Integer Linear Programming
2010
An Improved Branch and Bound Algorithm for Mixed Integer Nonlinear Programs
Computers & Operations Research, 1994
Mixed-integer nonlinear optimization
Acta Numerica, 2013
LaGO - An Object Oriented Library for Solving MINLPs
2002
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Mathematical Programming, 1986
Review of nonlinear mixed-integer and disjunctive programming techniques
Optimization and Engineering, 2002
A Partitioning Algorithm for the Mixed Integer Nonlinear Programming Problem
Management Science, 2003
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
Discrete Optimization, 2004
Improved branch and bound algorithm with a comparison between different LP solvers
2010 9th IEEE/IAS International Conference on Industry Applications, INDUSCON 2010, 2010
Mixed Integer Linear Programming Formulation Techniques
SIAM Review, 2015
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Mathematical Programming, 2010
Computers & Chemical Engineering, 2015
Branch and Bound in Mixed Integer Linear Programming Problems: A Survey of Techniques and Trends
arXiv (Cornell University), 2021
AIChE Journal, 2013
Operations Research, 2010
Solving Mixed Integer Bilinear Problems Using MILP Formulations
SIAM Journal on Optimization, 2013
Journal of Optimization Theory and Applications, 2019
Continuous Relaxation of MINLP Problems by Penalty Functions: A Practical Comparison
Computational Science and Its Applications – ICCSA 2017, 2017
Optimization Methods and Software, 2009
Modern branch-and-cut solvers for Mixed-Integer Linear Programming: a computational comparison
2015
Column enumeration based decomposition techniques for a class of non-convex MINLP problems
2009
Decomposition in integer linear programming
2005
Global optimization of mixed-integer nonlinear problems
Ioannis (Yannis) P Androulakis
AIChE Journal, 2000
Some Interval Approximation Techniques for MINLP
Symposium on Abstraction, Reformulation and Approximation, 2009
Tightness of prescriptive tree-based mixed-integer optimization formulations
arXiv (Cornell University), 2023
Convex mixed integer nonlinear programming problems and an outer approximation algorithm
Journal of Global Optimization, 2015