default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnton V. Eremeev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Alexandre Dolgui
, Anton V. Eremeev, Vyatcheslav S. Sigaev:
Fitness landscapes of buffer allocation problem for production lines with unreliable machines. Comput. Oper. Res. 172: 106819 (2024)- [c29]Duc-Cuong Dang, Anton V. Eremeev, Xiaoyu Qin:
Empirical Evaluation of Evolutionary Algorithms with Power-Law Ranking Selection. Intelligent Information Processing (1) 2024: 217-232 - 2022
- [j21]Anton V. Eremeev, Alexander V. Kel'manov, Mikhail Y. Kovalyov, Artem V. Pyatkin:
Selecting a subset of diverse points based on the squared euclidean distance. Ann. Math. Artif. Intell. 90(7-9): 965-977 (2022) - [j20]Christian Blum, Anton V. Eremeev, Julia V. Kovalenko:
Hybridizations of evolutionary algorithms with Large Neighborhood Search. Comput. Sci. Rev. 46: 100512 (2022) - [c28]Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre, Xiaoyu Qin:
Fast non-elitist evolutionary algorithms with power-law ranking selection. GECCO 2022: 1372-1380 - 2021
- [j19]Anton V. Eremeev, Alexander V. Spirov:
Modeling SELEX for regulatory regions using Royal Road and Royal Staircase fitness functions. Biosyst. 200: 104312 (2021) - [j18]Oleg Khamisov, Anton V. Eremeev, Vladimir Ushakov:
Preface to the special issue. Optim. Methods Softw. 36(6): 1097-1098 (2021) - [c27]Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Escaping Local Optima with Non-Elitist Evolutionary Algorithms. AAAI 2021: 12275-12283 - [c26]Anton V. Eremeev, Yulia V. Kovalenko:
Optimal recombination and adaptive restarts improve GA performance on the asymmetric TSP. GECCO Companion 2021: 29-30 - [c25]Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys. GECCO 2021: 1133-1141 - [c24]Pavel A. Borisovsky, Anton V. Eremeev, Yulia V. Kovalenko, Lidia A. Zaozerskaya:
Rig Routing with Possible Returns and Stochastic Drilling Times. MOTOR 2021: 51-66 - 2020
- [j17]Pavel A. Borisovsky, Anton V. Eremeev, Josef Kallrath:
Multi-product continuous plant scheduling: combination of decomposition, genetic algorithm, and constructive heuristic. Int. J. Prod. Res. 58(9): 2677-2695 (2020) - [j16]Anton V. Eremeev, Yulia V. Kovalenko:
A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem. Memetic Comput. 12(1): 23-36 (2020) - [j15]Anton V. Eremeev, Mikhail Y. Kovalyov, Pavel M. Kuznetsov:
Lot-size scheduling of a single product on unrelated parallel machines. Optim. Lett. 14(3): 557-568 (2020) - [c23]Anton V. Eremeev, Mikhail Y. Kovalyov, Artem V. Pyatkin:
On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances. LION 2020: 40-45 - [c22]Anton V. Eremeev, Alexander S. Yurkov:
On Symmetry Groups of Some Quadratic Programming Problems. MOTOR 2020: 35-48 - [c21]Anton V. Eremeev:
On Non-elitist Evolutionary Algorithms Optimizing Fitness Functions with a Plateau. MOTOR 2020: 329-342 - [i19]Anton V. Eremeev:
On Non-Elitist Evolutionary Algorithms Optimizing Fitness Functions with a Plateau. CoRR abs/2004.09491 (2020) - [i18]Anton V. Eremeev, Anton A. Malakhov, Maxim A. Sakhno, Maria Yu. Sosnovskaya:
Multi-Core Processor Scheduling with Respect to Data Bus Bandwidth. CoRR abs/2010.16058 (2020)
2010 – 2019
- 2019
- [c20]Anton V. Eremeev, Alexander V. Spirov:
Evaluation of runtime bounds for SELEX procedure with high selection pressure. GECCO (Companion) 2019: 113-114 - [c19]Anton V. Eremeev, Nikolay N. Tyunin, Alexander S. Yurkov:
Non-Convex Quadratic Programming Problems in Short Wave Antenna Array Optimization. MOTOR 2019: 34-45 - [c18]Anton V. Eremeev, Alexander V. Kel'manov, Mikhail Y. Kovalyov, Artem V. Pyatkin:
Maximum Diversity Problem with Squared Euclidean Distance. MOTOR 2019: 541-551 - [i17]Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Runtime Analysis of Fitness-Proportionate Selection on Linear Functions. CoRR abs/1908.08686 (2019) - 2018
- [j14]Anton V. Eremeev:
On Proportions of Fit Individuals in Population of Mutation-Based Evolutionary Algorithm with Tournament Selection. Evol. Comput. 26(2) (2018) - [j13]Dogan Corus, Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Level-Based Analysis of Genetic Algorithms and Other Search Processes. IEEE Trans. Evol. Comput. 22(5): 707-719 (2018) - [c17]Anton V. Eremeev:
A Restarting Rule Based on the Schnabel Census for Genetic Algorithms. LION 2018: 337-351 - [i16]Anton V. Eremeev, Alexander V. Spirov:
Modularity in biological evolution and evolutionary computation. CoRR abs/1811.07511 (2018) - 2017
- [j12]Alexandre Dolgui, Anton V. Eremeev, Viatcheslav S. Sigaev:
Analysis of a multicriterial buffer capacity optimization problem for a production line. Autom. Remote. Control. 78(7): 1276-1289 (2017) - [c16]Anton V. Eremeev, Alexander V. Kel'manov, Artem V. Pyatkin, Igor A. Ziegler:
On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum. AIST 2017: 142-151 - [c15]Anton V. Eremeev, Yulia V. Kovalenko:
Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem. LSSC 2017: 341-349 - [i15]Anton V. Eremeev, Yulia V. Kovalenko:
On Solving Travelling Salesman Problem with Vertex Requisitions. CoRR abs/1703.03963 (2017) - [i14]Anton V. Eremeev, Yulia V. Kovalenko:
Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem. CoRR abs/1706.06920 (2017) - [i13]Anton V. Eremeev, Alexander Kelmanov, Artem V. Pyatkin, Igor A. Ziegler:
On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum. CoRR abs/1707.06068 (2017) - [i12]Pavel A. Borisovsky, Anton V. Eremeev, Sergei Hrushev, Vadim Teplyakov, Mikhail Vorozhtsov:
Approximate solution of length-bounded maximum multicommodity flow with unit edge-lengths. CoRR abs/1708.00774 (2017) - 2016
- [c14]Anton V. Eremeev, Alexander V. Kel'manov, Artem V. Pyatkin:
On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction. AIST 2016: 51-57 - [c13]Anton V. Eremeev, Yulia V. Kovalenko:
Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times. DOOR 2016: 298-308 - [c12]Anton V. Eremeev:
Runtime Analysis of Genetic Algorithms with Very High Selection Pressure. DOOR (Supplement) 2016: 428-439 - [c11]Anton V. Eremeev, Alexander Kelmanov, Artem V. Pyatkin:
On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach. DOOR (Supplement) 2016: 526-535 - [c10]Anton V. Eremeev, Julia V. Kovalenko:
Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems. EvoCOP 2016: 138-153 - [i11]Anton V. Eremeev:
Hitting times of local and global optima in genetic algorithms with very high selection pressure. CoRR abs/1606.05784 (2016) - 2015
- [i10]Anton V. Eremeev:
On Proportions of Fit Individuals in Population of Genetic Algorithm with Tournament Selection. CoRR abs/1507.08007 (2015) - [i9]Anton V. Eremeev:
Evolutionary algorithms. CoRR abs/1511.06987 (2015) - [i8]Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Level-Based Analysis of Genetic Algorithms for Combinatorial Optimization. CoRR abs/1512.02047 (2015) - 2014
- [c9]Anton V. Eremeev, Julia V. Kovalenko:
On Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies. OR 2014: 301-306 - [c8]Dogan Corus, Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Level-Based Analysis of Genetic Algorithms and Other Search Processes. PPSN 2014: 912-921 - [i7]Dogan Corus, Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Level-based Analysis of Genetic Algorithms and other Search Processes. CoRR abs/1407.7663 (2014) - [i6]Anton V. Eremeev, Julia V. Kovalenko:
Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups. CoRR abs/1412.5067 (2014) - 2013
- [j11]Alexandre Dolgui, Anton V. Eremeev, Mikhail Y. Kovalyov, Viatcheslav S. Sigaev:
Complexity of Buffer Capacity Allocation Problems for Production Lines with Unreliable Machines. J. Math. Model. Algorithms Oper. Res. 12(2): 155-165 (2013) - [i5]Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen:
Evolutionary Algorithms and Dynamic Programming. CoRR abs/1301.4096 (2013) - [i4]Anton V. Eremeev:
Non-Elitist Genetic Algorithm as a Local Search Method. CoRR abs/1307.3463 (2013) - [i3]Anton V. Eremeev, Julia V. Kovalenko:
Optimal Recombination in Genetic Algorithms. CoRR abs/1307.5519 (2013) - 2011
- [j10]Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen:
Evolutionary algorithms and dynamic programming. Theor. Comput. Sci. 412(43): 6020-6035 (2011) - [c7]Anton V. Eremeev:
On Complexity of the Optimal Recombination for the Travelling Salesman Problem. EvoCOP 2011: 215-225 - 2010
- [p1]Alexandre Dolgui, Anton V. Eremeev, Olga Guschinskaya:
MIP-based GRASP and Genetic Algorithm for Balancing Transfer Lines. Matheuristics 2010: 189-208
2000 – 2009
- 2009
- [j9]Pavel A. Borisovsky, Alexandre Dolgui, Anton V. Eremeev:
Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder. Eur. J. Oper. Res. 195(3): 770-779 (2009) - [c6]Benjamin Doerr, Anton V. Eremeev, Christian Horoba, Frank Neumann, Madeleine Theile:
Evolutionary algorithms and dynamic programming. GECCO 2009: 771-778 - [c5]Olga Guschinskaya, Evgeny Gurevsky, Anton V. Eremeev, Alexandre Dolgui:
Balancing Mass Production Machining Lines with Genetic Algorithms. APMS 2009: 65-72 - 2008
- [j8]Anton V. Eremeev:
On Complexity of Optimal Recombination for Binary Representations of Solutions. Evol. Comput. 16(1): 127-147 (2008) - [j7]Pavel A. Borisovsky, Anton V. Eremeev:
Comparing evolutionary algorithms to the (1+1)-EA. Theor. Comput. Sci. 403(1): 33-41 (2008) - 2007
- [j6]Alexandre Dolgui, Anton V. Eremeev, Viatcheslav S. Sigaev:
HBBA: hybrid algorithm for buffer allocation in tandem production lines. J. Intell. Manuf. 18(3): 411-420 (2007) - [i2]Anton V. Eremeev:
On complexity of optimized crossover for binary representations. CoRR abs/0705.3766 (2007) - 2006
- [j5]Pavel A. Borisovsky, Anton V. Eremeev:
A comparative study of some evolutionary algorithms. Electron. Notes Discret. Math. 27: 7-8 (2006) - [j4]Alexandre Dolgui, Anton V. Eremeev, Valery S. Gordon, Alexander A. Kolokolov:
Guest Editorial - Discrete Optimization Methods in Production and Logistics. J. Math. Model. Algorithms 5(2): 139-141 (2006) - [i1]Anton V. Eremeev:
On Complexity of Optimized Crossover for Binary Representations. Theory of Evolutionary Algorithms 2006 - 2005
- [j3]Satyaveer Singh Chauhan, Anton V. Eremeev, Anna A. Romanova, Vladimir V. Servakh, Gerhard J. Woeginger:
Approximation of the supply scheduling problem. Oper. Res. Lett. 33(3): 249-254 (2005) - 2004
- [j2]Colin R. Reeves, Anton V. Eremeev:
Statistical analysis of local search landscapes. J. Oper. Res. Soc. 55(7): 687-693 (2004) - 2003
- [c4]Anton V. Eremeev, Colin R. Reeves:
On Confidence Intervals for the Number of Local Optima. EvoWorkshops 2003: 224-235 - 2002
- [j1]Alexandre Dolgui, Anton V. Eremeev, Alexander A. Kolokolov, Viatcheslav S. Sigaev:
A Genetic Algorithm for the Allocation of Buffer Storage Capacities in a Production Line with Unreliable Machines. J. Math. Model. Algorithms 1(2): 89-104 (2002) - [c3]Anton V. Eremeev, Colin R. Reeves:
Non-parametric Estimation of Properties of Combinatorial Landscapes. EvoWorkshops 2002: 31-40 - [c2]Pavel A. Borisovsky, Anton V. Eremeev:
A Study on Performance of the (1+1)-Evolutionary Algorithm. FOGA 2002: 271-288 - 2001
- [c1]Pavel A. Borisovsky, Anton V. Eremeev:
On Performance Estimates for Two Evolutionary Algorithms. EvoWorkshops 2001: 161-171
Coauthor Index
aka: Yulia V. Kovalenko
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
