An algorithmic framework for convex mixed integer nonlinear programs
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn et al. · Discrete Optimization · 2007
Cited by 902 works. doi:10.1016/j.disopt.2006.10.011
Authors
- Pierre Bonami
- Lorenz T. Biegler
- Andrew R. Conn
- Gérard Cornuéjols
- Ignacio E. Grossmann
- Carl D. Laird
- Jon Lee
- Andrea Lodi
- François Margot
- Nicolas W. Sawaya
- Andreas Wächter
References
- Integer programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Generalized Benders decomposition
- Benchmarking optimization software with performance profiles
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A combined penalty function and outer-approximation method for MINLP optimization
- A lift-and-project cutting plane algorithm for mixed 0–1 programs
- Experiments in mixed-integer linear programming
- Modelling and computational techniques for logic based integer programming