Polyhedral approximation in mixed-integer convex optimization
Authors:
Open Access
- 14 September 2017
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 172 (1-2) , 139-168
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Office of Science (DE-FG02-97ER25308)
- National Nuclear Security Administration (DE-AC52-06NA25396)
- National Science Foundation (CMMI-1351619)
This publication has 30 references indexed in Scilit:
- Algorithms for discrete nonlinear optimization in FICO Xpress2016
- Mixed-integer nonlinear optimizationActa Numerica, 2013
- NP-hardness of deciding convexity of quartic polynomials and related problemsMathematical Programming, 2011
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear ProgramsINFORMS Journal on Computing, 2010
- SCIP: solving constraint integer programsMathematical Programming Computation, 2009
- An algorithmic framework for convex mixed integer nonlinear programsDiscrete Optimization, 2008
- Knitro: An Integrated Package for Nonlinear Optimization2006
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- Lectures on Modern Convex Optimization2001
- Convex programming for disjunctive convex optimizationMathematical Programming, 1999