An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Mathematical Programming: Series A and B
A lift-and-project cutting plane algorithm for mixed 0-1 programs
Mathematical Programming: Series A and B
Solving mixed integer nonlinear programs by outer approximation
Mathematical Programming: Series A and B
Integrating SQP and Branch-and-Bound for Mixed Integer Nonlinear Programming
Computational Optimization and Applications
A Computational Study of Search Strategies for Mixed Integer Programming
INFORMS Journal on Computing
Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation
Computational Optimization and Applications
Global optimization of mixed-integer nonlinear programs: A theoretical and computational study
Mathematical Programming: Series A and B
Operations Research Letters
Branching and bounds tighteningtechniques for non-convex MINLP
Optimization Methods & Software - GLOBAL OPTIMIZATION
Perspective relaxation of mixed integer nonlinear programs with indicator variables
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Disjunctive cuts for non-convex mixed integer quadratically constrained programs
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A Note on “A Superior Representation Method for Piecewise Linear Functions”
INFORMS Journal on Computing
FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
INFORMS Journal on Computing
Optimal transition maneuvers for a class of V/STOL aircraft
Automatica (Journal of IFAC)
The Chvátal-Gomory Closure of a Strictly Convex Body
Mathematics of Operations Research
Lift-and-project cuts for mixed integer convex programs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Optimization of Supply Chain Systems with Price Elasticity of Demand
INFORMS Journal on Computing
Combination of Nonlinear and Linear Optimization of Transient Gas Networks
INFORMS Journal on Computing
An effective branch-and-bound algorithm for convex quadratic integer programming
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
The chvátal-gomory closure of an ellipsoid is a polyhedron
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Heuristics for convex mixed integer nonlinear programs
Computational Optimization and Applications
Mixed-integer nonlinear programs featuring "on/off" constraints
Computational Optimization and Applications
A two-stage non-linear program for optimal electrical grid power balance under uncertainty
Proceedings of the Winter Simulation Conference
Computers and Operations Research
Inexact solution of NLP subproblems in MINLP
Journal of Global Optimization
Facial structure and representation of integer hulls of convex sets
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Cost minimization for computational applications on hybrid cloud infrastructures
Future Generation Computer Systems
Multiphase mixed-integer optimal control applied to 4D trajectory planning in air traffic management
Proceedings of the 3rd International Conference on Application and Theory of Automation in Command and Control Systems
Deterministic global optimization in ab-initio quantum chemistry
Journal of Global Optimization
On branching rules for convex mixed-integer nonlinear optimization
Journal of Experimental Algorithmics (JEA)
Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on simulation in complex service systems
GloMIQO: Global mixed-integer quadratic optimizer
Journal of Global Optimization
Machine learning with operational costs
The Journal of Machine Learning Research
Hi-index | 0.00 |
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software for solving large-scale problems. Moreover, both fundamental building blocks, namely mixed integer linear programming and nonlinear programming, have seen considerable and steady progress in recent years. Wishing to exploit expertise in these areas as well as on previous work in mixed integer nonlinear programming, this work represents the first step in an ongoing and ambitious project within an open-source environment. COIN-OR is our chosen environment for the development of the optimization software. A class of hybrid algorithms, of which branch-and-bound and polyhedral outer approximation are the two extreme cases, are proposed and implemented. Computational results that demonstrate the effectiveness of this framework are reported. Both the library of mixed integer nonlinear problems that exhibit convex continuous relaxations, on which the experiments are carried out, and a version of the software used are publicly available.