Using Piecewise Linear Functions for Solving MINLPs
- 15 November 2011
- book chapter
- Published by Springer Nature
- p. 287-314
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Tight convex underestimators for ${\mathcal{C}^2}$ -continuous problems: II. multivariate functionsJournal of Global Optimization, 2008
- A special ordered set approach for optimizing a discontinuous separable piecewise linear functionOperations Research Letters, 2008
- The Convex Envelope of (n–1)-Convex FunctionsSIAM Journal on Optimization, 2008
- Variable Disaggregation in Network Flow Problems with Piecewise Linear CostsOperations Research, 2007
- The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycleOperations Research Letters, 2004
- On Polyhedral Approximations of the Second-Order ConeMathematics of Operations Research, 2001
- A composite algorithm for a concave‐cost network flow problemNetworks, 1989
- Global optimization using special ordered setsMathematical Programming, 1976
- On the Significance of Solving Linear Programming Problems with Some Integer VariablesEconometrica, 1960
- Sur les fonctions convexes et les inégalités entre les valeurs moyennesActa Mathematica, 1906