Kovalenko, Yulia V.; Zakharov, Aleksey O. Pareto-based hybrid algorithms for the bicriteria asymmetric travelling salesman problem. (English) Zbl 1444.90100 Khachay, Michael (ed.) et al., Mathematical optimization theory and operations research. 18th international conference, MOTOR 2019, Ekaterinburg, Russia, July 8–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11548, 358-373 (2019). MSC: 90C27 90C29 90C59 PDFBibTeX XMLCite \textit{Y. V. Kovalenko} and \textit{A. O. Zakharov}, Lect. Notes Comput. Sci. 11548, 358--373 (2019; Zbl 1444.90100) Full Text: DOI
Eremeev, Anton V.; Kovalenko, Yulia V. Genetic algorithm with optimal recombination for the asymmetric travelling salesman problem. (English) Zbl 1437.90136 Lirkov, Ivan (ed.) et al., Large-scale scientific computing. 11th international conference, LSSC 2017, Sozopol, Bulgaria, June 5–9, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10665, 341-349 (2018). MSC: 90C27 68W50 90C59 PDFBibTeX XMLCite \textit{A. V. Eremeev} and \textit{Y. V. Kovalenko}, Lect. Notes Comput. Sci. 10665, 341--349 (2018; Zbl 1437.90136) Full Text: DOI arXiv
Kovalenko, Yu. V. On complexity of optimal recombination for flowshop scheduling problems. (Russian, English) Zbl 1349.90444 Diskretn. Anal. Issled. Oper. 23, No. 2, 41-62 (2016); translation in J. Appl. Ind. Math. 10, No. 2, 220-231 (2016). MSC: 90B36 90C59 65K10 PDFBibTeX XMLCite \textit{Yu. V. Kovalenko}, Diskretn. Anal. Issled. Oper. 23, No. 2, 41--62 (2016; Zbl 1349.90444); translation in J. Appl. Ind. Math. 10, No. 2, 220--231 (2016) Full Text: DOI
Eremeev, Anton V.; Kovalenko, Julia V. Optimal recombination in genetic algorithms for combinatorial optimization problems. II. (English) Zbl 1458.90645 Yugosl. J. Oper. Res. 24, No. 2, 165-186 (2014). MSC: 90C59 90C27 PDFBibTeX XMLCite \textit{A. V. Eremeev} and \textit{J. V. Kovalenko}, Yugosl. J. Oper. Res. 24, No. 2, 165--186 (2014; Zbl 1458.90645) Full Text: DOI
Eremeev, Anton V.; Kovalenko, Julia V. Optimal recombination in genetic algorithms for combinatorial optimization problems. I. (English) Zbl 1458.90003 Yugosl. J. Oper. Res. 24, No. 1, 1-20 (2014). MSC: 90-02 90C59 90C10 PDFBibTeX XMLCite \textit{A. V. Eremeev} and \textit{J. V. Kovalenko}, Yugosl. J. Oper. Res. 24, No. 1, 1--20 (2014; Zbl 1458.90003) Full Text: DOI
Eremeev, A. V.; Kovalenko, Yu. V. On complexity of optimal recombination for one scheduling problem with setup times. (Russian) Zbl 1324.90071 Diskretn. Anal. Issled. Oper. 19, No. 3, 13-26 (2012). MSC: 90B36 90C59 65Y20 PDFBibTeX XMLCite \textit{A. V. Eremeev} and \textit{Yu. V. Kovalenko}, Diskretn. Anal. Issled. Oper. 19, No. 3, 13--26 (2012; Zbl 1324.90071) Full Text: MNR
Eremeev, A. V.; Kovalenko, Yu. V. On the scheduling problem with machine grouping according to technology. (Russian) Zbl 1249.90175 Diskretn. Anal. Issled. Oper. 18, No. 5, 54-79 (2011). MSC: 90C11 90C90 PDFBibTeX XMLCite \textit{A. V. Eremeev} and \textit{Yu. V. Kovalenko}, Diskretn. Anal. Issled. Oper. 18, No. 5, 54--79 (2011; Zbl 1249.90175)