Modeling and Analysis of Genetic Algorithm with Tournament Selection. - Anton V. Eremeev (Artificial Evolution, 1999)

On Performance Estimates for Two Evolutionary Algorithms. - Pavel A. Borisovsky; Anton V. Eremeev (EvoWorkshops, 2001)

Non-parametric Estimation of Properties of Combinatorial Landscapes. - Anton V. Eremeev; Colin R. Reeves (EvoWorkshops, 2002)

A Study on Performance of the (1+1)-Evolutionary Algorithm. - Pavel A. Borisovsky; Anton V. Eremeev (FOGA, 2002)

A Genetic Algorithm for the Allocation of Buffer Storage Capacities in a Production Line with Unreliable Machines. - Alexandre Dolgui; Anton V. Eremeev; Alexander A. Kolokolov; Viatcheslav S. Sigaev (J. Math. Model. Algorithms, 2002)

On Confidence Intervals for the Number of Local Optima. - Anton V. Eremeev; Colin R. Reeves (EvoWorkshops, 2003)

Statistical analysis of local search landscapes. - Colin R. Reeves; Anton V. Eremeev (J. Oper. Res. Soc., 2004)

Approximation of the supply scheduling problem. - Satyaveer Singh Chauhan; Anton V. Eremeev; Anna A. Romanova; Vladimir V. Servakh; Gerhard J. Woeginger (Oper. Res. Lett., 2005)

On Complexity of Optimized Crossover for Binary Representations. - Anton V. Eremeev (Theory of Evolutionary Algorithms, 2006)

A comparative study of some evolutionary algorithms. - Pavel A. Borisovsky; Anton V. Eremeev (Electron. Notes Discret. Math., 2006)

Guest Editorial - Discrete Optimization Methods in Production and Logistics. - Alexandre Dolgui; Anton V. Eremeev; Valery S. Gordon; Alexander A. Kolokolov (J. Math. Model. Algorithms, 2006)

HBBA: hybrid algorithm for buffer allocation in tandem production lines. - Alexandre Dolgui; Anton V. Eremeev; Viatcheslav S. Sigaev (J. Intell. Manuf., 2007)

On Complexity of Optimal Recombination for Binary Representations of Solutions. - Anton V. Eremeev (Evol. Comput., 2008)

Comparing evolutionary algorithms to the (1+1)-EA. - Pavel A. Borisovsky; Anton V. Eremeev (Theor. Comput. Sci., 2008)

Balancing Mass Production Machining Lines with Genetic Algorithms. - Olga Guschinskaya; Evgeny Gurevsky 001; Anton V. Eremeev; Alexandre Dolgui (APMS, 2009)

Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder. - Pavel A. Borisovsky; Alexandre Dolgui; Anton V. Eremeev (Eur. J. Oper. Res., 2009)

MIP-based GRASP and Genetic Algorithm for Balancing Transfer Lines. - Alexandre Dolgui; Anton V. Eremeev; Olga Guschinskaya (Matheuristics, 2010)

On Complexity of the Optimal Recombination for the Travelling Salesman Problem. - Anton V. Eremeev (EvoCOP, 2011)

Evolutionary algorithms and dynamic programming. - Benjamin Doerr; Anton V. Eremeev; Frank Neumann 001; Madeleine Theile; Christian Thyssen (Theor. Comput. Sci., 2011)

Non-Elitist Genetic Algorithm as a Local Search Method. - Anton V. Eremeev (CoRR, 2013)

Optimal Recombination in Genetic Algorithms. - Anton V. Eremeev; Julia V. Kovalenko (CoRR, 2013)

Complexity of Buffer Capacity Allocation Problems for Production Lines with Unreliable Machines. - Alexandre Dolgui; Anton V. Eremeev; Mikhail Y. Kovalyov; Viatcheslav S. Sigaev (J. Math. Model. Algorithms Oper. Res., 2013)

On Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies. - Anton V. Eremeev; Julia V. Kovalenko (OR, 2014)

Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups. - Anton V. Eremeev; Julia V. Kovalenko (CoRR, 2014)

Level-Based Analysis of Genetic Algorithms for Combinatorial Optimization. - Duc-Cuong Dang; Anton V. Eremeev; Per Kristian Lehre (CoRR, 2015)

On Proportions of Fit Individuals in Population of Genetic Algorithm with Tournament Selection. - Anton V. Eremeev (CoRR, 2015)

Evolutionary algorithms. - Anton V. Eremeev (CoRR, 2015)

On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction. - Anton V. Eremeev; Alexander V. Kel'manov; Artem V. Pyatkin (AIST, 2016)

Runtime Analysis of Genetic Algorithms with Very High Selection Pressure. - Anton V. Eremeev (DOOR (Supplement), 2016)

Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times. - Anton V. Eremeev; Yulia V. Kovalenko (DOOR, 2016)

On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach. - Anton V. Eremeev; Alexander Kelmanov; Artem V. Pyatkin (DOOR (Supplement), 2016)

Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems. - Anton V. Eremeev; Julia V. Kovalenko (EvoCOP, 2016)

Hitting times of local and global optima in genetic algorithms with very high selection pressure. - Anton V. Eremeev (CoRR, 2016)

On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum. - Anton V. Eremeev; Alexander V. Kel'manov; Artem V. Pyatkin; Igor A. Ziegler (AIST, 2017)

Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem. - Anton V. Eremeev; Yulia V. Kovalenko (LSSC, 2017)

Analysis of a multicriterial buffer capacity optimization problem for a production line. - Alexandre Dolgui; Anton V. Eremeev; Viatcheslav S. Sigaev (Autom. Remote. Control., 2017)

On Solving Travelling Salesman Problem with Vertex Requisitions. - Anton V. Eremeev; Yulia V. Kovalenko (CoRR, 2017)

Approximate solution of length-bounded maximum multicommodity flow with unit edge-lengths. - Pavel A. Borisovsky; Anton V. Eremeev; Sergei Hrushev; Vadim Teplyakov; Mikhail Vorozhtsov (CoRR, 2017)

A Restarting Rule Based on the Schnabel Census for Genetic Algorithms. - Anton V. Eremeev (LION, 2018)

Modularity in biological evolution and evolutionary computation. - Anton V. Eremeev; Alexander V. Spirov (CoRR, 2018)

On Proportions of Fit Individuals in Population of Mutation-Based Evolutionary Algorithm with Tournament Selection. - Anton V. Eremeev (Evol. Comput., 2018)

Level-Based Analysis of Genetic Algorithms and Other Search Processes. - Dogan Corus; Duc-Cuong Dang; Anton V. Eremeev; Per Kristian Lehre (IEEE Trans. Evol. Comput., 2018)

Evaluation of runtime bounds for SELEX procedure with high selection pressure. - Anton V. Eremeev; Alexander V. Spirov (GECCO (Companion), 2019)

Maximum Diversity Problem with Squared Euclidean Distance. - Anton V. Eremeev; Alexander V. Kel'manov; Mikhail Y. Kovalyov; Artem V. Pyatkin (MOTOR, 2019)

Non-Convex Quadratic Programming Problems in Short Wave Antenna Array Optimization. - Anton V. Eremeev; Nikolay N. Tyunin; Alexander S. Yurkov (MOTOR, 2019)

Runtime Analysis of Fitness-Proportionate Selection on Linear Functions. - Duc-Cuong Dang; Anton V. Eremeev; Per Kristian Lehre (CoRR, 2019)

On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances. - Anton V. Eremeev; Mikhail Y. Kovalyov; Artem V. Pyatkin (LION, 2020)

On Non-elitist Evolutionary Algorithms Optimizing Fitness Functions with a Plateau. - Anton V. Eremeev (MOTOR, 2020)

On Symmetry Groups of Some Quadratic Programming Problems. - Anton V. Eremeev; Alexander S. Yurkov (MOTOR, 2020)

Multi-Core Processor Scheduling with Respect to Data Bus Bandwidth. - Anton V. Eremeev; Anton A. Malakhov; Maxim A. Sakhno; Maria Yu. Sosnovskaya (CoRR, 2020)

Multi-product continuous plant scheduling: combination of decomposition, genetic algorithm, and constructive heuristic. - Pavel A. Borisovsky; Anton V. Eremeev; Josef Kallrath (Int. J. Prod. Res., 2020)

A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem. - Anton V. Eremeev; Yulia V. Kovalenko (Memetic Comput., 2020)

Lot-size scheduling of a single product on unrelated parallel machines. - Anton V. Eremeev; Mikhail Y. Kovalyov; Pavel M. Kuznetsov (Optim. Lett., 2020)

Escaping Local Optima with Non-Elitist Evolutionary Algorithms. - Duc-Cuong Dang; Anton V. Eremeev; Per Kristian Lehre (AAAI, 2021)

Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys. - Duc-Cuong Dang; Anton V. Eremeev; Per Kristian Lehre (GECCO, 2021)

Optimal recombination and adaptive restarts improve GA performance on the asymmetric TSP. - Anton V. Eremeev; Yulia V. Kovalenko (GECCO Companion, 2021)

Rig Routing with Possible Returns and Stochastic Drilling Times. - Pavel A. Borisovsky; Anton V. Eremeev; Yulia V. Kovalenko; Lidia A. Zaozerskaya (MOTOR, 2021)

Modeling SELEX for regulatory regions using Royal Road and Royal Staircase fitness functions. - Anton V. Eremeev; Alexander V. Spirov (Biosyst., 2021)

Preface to the special issue. - Oleg Khamisov; Anton V. Eremeev; Vladimir Ushakov (Optim. Methods Softw., 2021)

Fast non-elitist evolutionary algorithms with power-law ranking selection. - Duc-Cuong Dang; Anton V. Eremeev; Per Kristian Lehre; Xiaoyu Qin (GECCO, 2022)

Selecting a subset of diverse points based on the squared euclidean distance. - Anton V. Eremeev; Alexander V. Kel'manov; Mikhail Y. Kovalyov; Artem V. Pyatkin (Ann. Math. Artif. Intell., 2022)

Hybridizations of evolutionary algorithms with Large Neighborhood Search. - Christian Blum 001; Anton V. Eremeev; Julia V. Kovalenko (Comput. Sci. Rev., 2022)

Generalization of the Heavy-Tailed Mutation in the (1+(λ, λ)) Genetic Algorithm. - Anton V. Eremeev; Valentin Topchii (GECCO Companion, 2024)

Empirical Evaluation of Evolutionary Algorithms with Power-Law Ranking Selection. - Duc-Cuong Dang; Anton V. Eremeev; Xiaoyu Qin (IIP (1), 2024)

Fitness landscapes of buffer allocation problem for production lines with unreliable machines. - Alexandre Dolgui; Anton V. Eremeev; Vyatcheslav S. Sigaev (Comput. Oper. Res., 2024)