Anton V. Eremeev

Orcid: 0000-0001-5289-7874

According to our database1, Anton V. Eremeev authored at least 63 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fitness landscapes of buffer allocation problem for production lines with unreliable machines.
Comput. Oper. Res., 2024

Empirical Evaluation of Evolutionary Algorithms with Power-Law Ranking Selection.
Proceedings of the Intelligent Information Processing XII, 2024

2022
Hybridizations of evolutionary algorithms with Large Neighborhood Search.
Comput. Sci. Rev., 2022

Selecting a subset of diverse points based on the squared euclidean distance.
Ann. Math. Artif. Intell., 2022

Fast non-elitist evolutionary algorithms with power-law ranking selection.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

2021
Preface to the special issue.
Optim. Methods Softw., 2021

Modeling SELEX for regulatory regions using Royal Road and Royal Staircase fitness functions.
Biosyst., 2021

Rig Routing with Possible Returns and Stochastic Drilling Times.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2021

Optimal recombination and adaptive restarts improve GA performance on the asymmetric TSP.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Escaping Local Optima with Non-Elitist Evolutionary Algorithms.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Lot-size scheduling of a single product on unrelated parallel machines.
Optim. Lett., 2020

A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem.
Memetic Comput., 2020

Multi-product continuous plant scheduling: combination of decomposition, genetic algorithm, and constructive heuristic.
Int. J. Prod. Res., 2020

Multi-Core Processor Scheduling with Respect to Data Bus Bandwidth.
CoRR, 2020

On Symmetry Groups of Some Quadratic Programming Problems.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

On Non-elitist Evolutionary Algorithms Optimizing Fitness Functions with a Plateau.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances.
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

2019
Runtime Analysis of Fitness-Proportionate Selection on Linear Functions.
CoRR, 2019

Non-Convex Quadratic Programming Problems in Short Wave Antenna Array Optimization.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Maximum Diversity Problem with Squared Euclidean Distance.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Evaluation of runtime bounds for SELEX procedure with high selection pressure.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

2018
Level-Based Analysis of Genetic Algorithms and Other Search Processes.
IEEE Trans. Evol. Comput., 2018

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

Modularity in biological evolution and evolutionary computation.
CoRR, 2018

A Restarting Rule Based on the Schnabel Census for Genetic Algorithms.
Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

2017
Approximate solution of length-bounded maximum multicommodity flow with unit edge-lengths.
CoRR, 2017

On Solving Travelling Salesman Problem with Vertex Requisitions.
CoRR, 2017

Analysis of a multicriterial buffer capacity optimization problem for a production line.
Autom. Remote. Control., 2017

Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem.
Proceedings of the Large-Scale Scientific Computing - 11th International Conference, 2017

On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum.
Proceedings of the Analysis of Images, Social Networks and Texts, 2017

2016
Hitting times of local and global optima in genetic algorithms with very high selection pressure.
CoRR, 2016

Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2016

On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times.
Proceedings of the Discrete Optimization and Operations Research, 2016

Runtime Analysis of Genetic Algorithms with Very High Selection Pressure.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction.
Proceedings of the Analysis of Images, Social Networks and Texts, 2016

2015
Evolutionary algorithms.
CoRR, 2015

On Proportions of Fit Individuals in Population of Genetic Algorithm with Tournament Selection.
CoRR, 2015

Level-Based Analysis of Genetic Algorithms for Combinatorial Optimization.
CoRR, 2015

2014
Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups.
CoRR, 2014

On Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies.
Proceedings of the Operations Research Proceedings 2014, 2014

2013
Complexity of Buffer Capacity Allocation Problems for Production Lines with Unreliable Machines.
J. Math. Model. Algorithms Oper. Res., 2013

Optimal Recombination in Genetic Algorithms.
CoRR, 2013

Non-Elitist Genetic Algorithm as a Local Search Method.
CoRR, 2013

2011
Evolutionary algorithms and dynamic programming.
Theor. Comput. Sci., 2011

On Complexity of the Optimal Recombination for the Travelling Salesman Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011

2010
MIP-based GRASP and Genetic Algorithm for Balancing Transfer Lines.
Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

2009
Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder.
Eur. J. Oper. Res., 2009

Balancing Mass Production Machining Lines with Genetic Algorithms.
Proceedings of the Advances in Production Management Systems. New Challenges, New Approaches, 2009

2008
Comparing evolutionary algorithms to the (1+1)-EA.
Theor. Comput. Sci., 2008

On Complexity of Optimal Recombination for Binary Representations of Solutions.
Evol. Comput., 2008

2007
HBBA: hybrid algorithm for buffer allocation in tandem production lines.
J. Intell. Manuf., 2007

2006
Guest Editorial - Discrete Optimization Methods in Production and Logistics.
J. Math. Model. Algorithms, 2006

A comparative study of some evolutionary algorithms.
Electron. Notes Discret. Math., 2006

On Complexity of Optimized Crossover for Binary Representations.
Proceedings of the Theory of Evolutionary Algorithms, 05.02. - 10.02.2006, 2006

2005
Approximation of the supply scheduling problem.
Oper. Res. Lett., 2005

2004
Statistical analysis of local search landscapes.
J. Oper. Res. Soc., 2004

2003
On Confidence Intervals for the Number of Local Optima.
Proceedings of the Applications of Evolutionary Computing, 2003

2002
A Genetic Algorithm for the Allocation of Buffer Storage Capacities in a Production Line with Unreliable Machines.
J. Math. Model. Algorithms, 2002

A Study on Performance of the (1+1)-Evolutionary Algorithm.
Proceedings of the Seventh Workshop on Foundations of Genetic Algorithms, 2002

Non-parametric Estimation of Properties of Combinatorial Landscapes.
Proceedings of the Applications of Evolutionary Computing, 2002

2001
On Performance Estimates for Two Evolutionary Algorithms.
Proceedings of the Applications of Evolutionary Computing, 2001


  Loading...