A hybrid LP/NLP paradigm for global optimization relaxations
Top Cited Papers
- 14 May 2018
- journal article
- research article
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 10 (3) , 383-421
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Global optimization of nonconvex problems with multilinear intermediatesMathematical Programming Computation, 2014
- NP-hardness of deciding convexity of quartic polynomials and related problemsMathematical Programming, 2011
- A Unifying Polyhedral Approximation Framework for Convex OptimizationSIAM Journal on Optimization, 2011
- Branching and bounds tighteningtechniques for non-convex MINLPOptimization Methods and Software, 2009
- An algorithmic framework for convex mixed integer nonlinear programsDiscrete Optimization, 2008
- Convex Optimization2004
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear ProgrammingINFORMS Journal on Computing, 2003
- Analyzing Mathematical Programs Using MProbeAnnals of Operations Research, 2001
- Generalized Concavity1988
- Global optimization using special ordered setsMathematical Programming, 1976