- Anemari Gračnar, Miha Kovačič, Miran Brezočnik, “Decreasing of guides changing with pass design optimization on continuous rolling mill using a genetic algorithm”, Materials and Manufacturing Processes, 35, no. 6, 2020, 663
- Renato Tinós, Darrell Whitley, Gabriela Ochoa, “A New Generalized Partition Crossover for the Traveling Salesman Problem: Tunneling between Local Optima”, Evolutionary Computation, 28, no. 2, 2020, 255
- Anton V. Eremeev, Julia V. Kovalenko, 9595, Evolutionary Computation in Combinatorial Optimization, 2016, 138
- Christian Blum, Maria J. Blesa, “Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem”, Applied Soft Computing, 62, 2018, 15
- Khaoula Bouazzi, Moez Hammami, Sadok Bouamama, “Application of an improved genetic algorithm to Hamiltonian circuit problem”, Procedia Computer Science, 192, 2021, 4337
- Christian Blum, Anton Eremeev, Yulia Zakharova, “Hybridizations of evolutionary algorithms with Large Neighborhood Search”, Computer Science Review, 46, 2022, 100512
- À.Î. Çàõàðîâ, Ñáîðíèê òðóäîâ XVIII Ðîññèéñêîé êîíôåðåíöèè "ÐÀÑÏÐÅÄÅËÅÍÍÛÅ ÈÍÔÎÐÌÀÖÈÎÍÍÎ-ÂÛ×ÈÑËÈÒÅËÜÍÛÅ ÐÅÑÓÐÑÛ", 2023, 83
- Julia Kovalenko, 1776, 2016, 050005
- Anton V. Eremeev, Yulia V. Kovalenko, “A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem”, Memetic Comp., 12, no. 1, 2020, 23
- Pablo Moscato, Luke Mathieson, Business and Consumer Analytics: New Ideas, 2019, 545