An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- 14 January 2019
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 74 (4) , 639-675
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Laboratory Directed Research and Development (20170201ER)
This publication has 45 references indexed in Scilit:
- Systematic modeling of discrete‐continuous optimization models through generalized disjunctive programmingAIChE Journal, 2013
- GloMIQO: Global mixed-integer quadratic optimizerJournal of Global Optimization, 2012
- A new approach for global optimization of a class of MINLP problems with applications to water management and pooling problemsAIChE Journal, 2011
- Piecewise linear relaxation of bilinear programs using bivariate partitioningAIChE Journal, 2009
- Branching and bounds tighteningtechniques for non-convex MINLPOptimization Methods and Software, 2009
- Piecewise MILP under‐ and overestimators for global optimization of bilinear programsAIChE Journal, 2008
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry ProblemInternational Transactions in Operational Research, 2008
- Global optimization of a combinatorially complex generalized pooling problemAIChE Journal, 2005
- A polyhedral branch-and-cut approach to global optimizationMathematical Programming, 2005
- Test examples for nonlinear programming codesJournal of Optimization Theory and Applications, 1980