Author:
Barkalov K. A.,Gergel V. P.,Lebedev I. G.
Reference25 articles.
1. S. Burer and A. N. Letchford, ‘‘Non-convex mixed-integer nonlinear programming: A survey,’’ Surv. Oper. Res. Manage. Sci. 17, 97–106 (2012).
2. F. Boukouvala, R. Misener, and C. A. Floudas, ‘‘Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO,’’ Eur. J. Oper. Res. 252, 701–727 (2016).
3. P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wächter, ‘‘Branching and bounds tightening techniques for non-convex MINLP,’’ Optim. Method. Software 24, 597–634 (2009).
4. S. Vigerske and A. Gleixner, ‘‘SCIP: Global optimization of mixed-integer nonlinear programs in a branch-and-cut framework,’’ Optim. Method. Software 33, 563–593 (2018).
5. K. Deep, K. P. Singh, M. L. Kansal, and C. Mohan, ‘‘A real coded genetic algorithm for solving integer and mixed integer optimization problems,’’ Appl. Math. Comput. 212, 505–518 (2009).