An algorithmic framework for convex mixed integer nonlinear programs

@article{Bonami2008AnAF,
title={An algorithmic framework for convex mixed integer nonlinear programs},
author={Pierre Bonami and Lorenz T. Biegler and Andrew R. Conn and G{\'e}rard Cornu{\'e}jols and Ignacio E. Grossmann and Carl D. Laird and Jon Lee and Andrea Lodi and François Margot and Nicolas W. Sawaya and Andreas W{\"a}chter},
journal={Discrete Optimization},
year={2008},
volume={5},
pages={186-204}
}

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… CONTINUE READING