1. Abhishek K., Leyffer S., Linderoth J.: FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs. INFORMS J. Comput. 22(4), 555–567 (2010)
2. Andersen E.D., Andersen K.D.: Presolving in linear programming. Math. Program. 71, 221–245 (1995)
3. Belotti, P.: couenne: a user’s manual. Technical report, Lehigh University (2009)
4. Belotti P., Cafieri S., Lee J., Liberti L.: Feasibility-based bounds tightening via fixed points. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications, volume 6508 of Lecture Notes in Computer Science, pp. 65–76. Springer, Berlin (2010)
5. Belotti P., Lee J., Liberti L., Margot F., Wächter A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4-5), 597–634 (2009)