Skip to content

References

  • Belotti, P., Lee, J., Liberti, L., Margot, F. and Wächter, A. (2009). Branching and bounds tightening techniques for non-convex MINLP. Optimization Methods and Software, 24(4–5), 597–634. doi:10.1080/10556780903087124
  • Bradbury, J., Frostig, R., Hawkins, P., Johnson, M. J., Leary, C., Maclaurin, D., Necula, G., Paszke, A., VanderPlas, J., Wanderman-Milne, S. and Zhang, Q. (2018). JAX: composable transformations of Python+NumPy programs. GitHub
  • Bussieck, M. R., Drud, A. S. and Meeraus, A. (2003). MINLPLib, a collection of test models for mixed-integer nonlinear programming. INFORMS Journal on Computing, 15(1), 114–119. doi:10.1287/ijoc.15.1.114.15159
  • Fourer, R., Ma, J. and Martin, K. (2010). OSiL: an instance language for optimization. Computational Optimization and Applications, 45(1), 181–203. doi:10.1007/s10589-008-9169-6
  • Frostig, R., Johnson, M. J. and Leary, C. (2018). Compiling machine learning programs via high-level tracing. SysML Conference. PDF
  • Hojny, C. et al. (2025). The SCIP Optimization Suite 10.0. arXiv. arXiv:2511.18580
  • McCormick, G. P. (1976). Computability of global solutions to factorable nonconvex programs. Part I, convex underestimating problems. Mathematical Programming, 10, 147–175. doi:10.1007/BF01580665
  • Mitsos, A., Chachuat, B. and Barton, P. I. (2009). McCormick-based relaxations of algorithms. SIAM Journal on Optimization, 20(2), 573–601. doi:10.1137/080717341
  • Vigerske, S. and Gleixner, A. (2018). SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optimization Methods and Software, 33(3), 563–593. doi:10.1080/10556788.2017.1335312
  • Wächter, A. and Biegler, L. T. (2006). On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Mathematical Programming, 106(1), 25–57. doi:10.1007/s10107-004-0559-y

Software and specifications: