Persons: Eremeev, Anton Valentinovich

Persons

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Eremeev, Anton Valentinovich

Total publications:	44 (44)
in MathSciNet:	24 (24)
in zbMATH:	23 (23)
in Web of Science:	21 (21)
in Scopus:	33 (33)
Cited articles:	34
Citations:	565

Number of views:
This page:	1735
Abstract pages:	7655
Full texts:	3388
References:	548

Associate professor

Doctor of physico-mathematical sciences (2013)

Speciality:

05.13.17 (Theoretical foundation for informatics)

E-mail:

Website:

https://iitam.omsk.net.ru/~eremeev/papers_r.htm

https://www.mathnet.ru/eng/person27752

List of publications on Google Scholar

https://zbmath.org/authors/ai:eremeev.anton-v

https://mathscinet.ams.org/mathscinet/MRAuthorID/659333

https://elibrary.ru/author_items.asp?spin=5541-4410

https://orcid.org/0000-0001-5289-7874

https://www.webofscience.com/wos/author/record/E-8775-2013

https://www.scopus.com/authid/detail.url?authorId=36018145800

Full list of publications:

scientific publications

by years

by types

by times cited

common list

		Citations (Crossref Cited-By Service + Math-Net.Ru)

1.	A. B. Dolgui, A. V. Eremeev, V. S. Sigaev, “Analysis of multiobjective buffers allocation problem in production line”, Avtomat. i Telemekh.

2023
2.	Anton V. Eremeev, Maria Yu. Sakhno, “Multi-core processor scheduling with respect to the mutual influence of jobs”, Num. Meth. Prog., 24:1 (2023), 115–126
3.	A. V. Eremeev, M. A. Sakhno, “The problem of scheduling for call-centre operators”, Diskretn. Anal. Issled. Oper., 30:2 (2023), 48–66

2018
4.	Eremeev, A.V., Kelmanov, A.V., Pyatkin, A.V., Ziegler, I.A., “On finding maximum cardinality subset of vectors with a constraint on normalized squared length of vectors sum”, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10716 LNCS, Springer Verlag, 2018, 142-151 (to appear)	3 ^[x]

2017
5.	A. B. Dolgui, A. V. Eremeev, V. S. Sigaev, “Analysis of a multicriterial buffer capacity optimization problem for a production line”, Autom. Remote Control, 78:7 (2017), 1276–1289
6.	A. V. Eremeev, “On computational complexity of the electric power flow optimization problem in market environment”, J. Appl. Industr. Math., 11:4 (2017), 500–505
7.	Eremeev, Anton V.; Kel'manov, Alexander V.; Pyatkin, Artem V., “On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction”, Analysis of Images, Social Networks and Texts, 661 (2017), 51-57
8.	Borisovsky, P.A., Eremeev, A.V., Kallrath, J., “On hybrid method for medium-term multi-product continuous plant scheduling”, Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017 (Novosibirsk; Russian Federation; 18 September 2017 do 22 September 2017), Institute of Electrical and Electronics Engineers Inc., 2017, 42-47	1 ^[x]
9.	Eremeev, A.V., Kovalenko, Y.V., “On solving travelling salesman problem with vertex requisitions”, Yugoslav Journal of Operations Research, 2017, 415-426	3 ^[x]
10.	Eremeev, A.V., “Hitting times of local and global optima in genetic algorithms with very high selection pressure2017 Yugoslav Journal of Operations Research”, Yugoslav Journal of Operations Research, 27:3 (2017), 323-339 http://www.doiserbia.nb.rs/img/doi/0354-0243/2017/0354-02431600016E.pdf	5 ^[x]
11.	Corus, D., Dang, D., Eremeev, A.V., Lehre, P.K., “Level-Based Analysis of Genetic Algorithms and Other Search Processes”, IEEE Transactions on Evolutionary Computation, 2017 http://www.doiserbia.nb.rs/img/doi/0354-0243/2017/0354-02431700003E.pdf	98 ^[x]

2016
12.	A. V. Eremeev, A. V. Kel'manov, A. V. Pyatkin, “On the complexity and approximability of some Euclidean optimal summing problems”, Comput. Math. Math. Phys., 56:10 (2016), 1813–1817
13.	Eremeev, A.V.; Kovalenko, J.V., “Experimental evaluation of two approaches to optimal recombination for permutation problems”, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9595, 2016, 138-153 (to appear)	5 ^[x]

2014
14.	A.V. Eremeev, J.V. Kovalenko, “Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I.”, Yugoslav Journal of Operations Research, 24:1 (2014), 1-20 http://dx.doi.org/10.2298/YJOR130731040E	8 ^[x]
15.	A.V. Eremeev, J.V. Kovalenko, “Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II.”, Yugoslav Journal of Operations Research, 24:2 (2014), 165-186 http://dx.doi.org/10.2298/YJOR131030041E	18 ^[x]
16.	A. V. Eremeev, J. V. Kovalenko, “Polynomially Solvable Cases of the Project Scheduling Problem with Changing Consumption and Supply Rates of Nonaccumulative Resources”, IIGU Ser. Matematika, 9 (2014), 26–38

2013
17.	A. Dolgui, A. Eremeev, M. Y. Kovalyov, V. Sigaev, “Complexity of buffer capacity allocation problems for production lines with unreliable machines”, Journal of Mathematical Modelling and Algorithms in Operations Research, 12:2 (2013), 155-165 http://link.springer.com/article/10.1007	19 ^[x]

2012
18.	A. V. Eremeev, Yu. V. Kovalenko, “On complexity of optimal recombination for one scheduling problem with setup times”, Diskretn. Anal. Issled. Oper., 19:3 (2012), 13–26
19.	A. V. Eremeev, “Genetic algorithm with tournament selection as a local search method”, J. Appl. Industr. Math., 6:3 (2012), 286–294

2011
20.	A. V. Eremeev, Ju. V. Kovalenko, “On scheduling with technology based machines grouping”, Diskretn. Anal. Issled. Oper., 18:5 (2011), 54–79
21.	A. V. Eremeev, “The complexity of optimal recombination for the traveling salesman problem”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 27–40
22.	B. Doerr, A. Eremeev, F. Neumann, M. Theile, C. Thyssen, “Evolutionary algorithms and dynamic programming”, Theoretical Computer Science, 412 (2011), 6020-6035	14 ^[x]
23.	Guschinskaya O., Gurevsky E., Dolgui A., Eremeev A., “Metaheuristic approaches for the design of machining lines”, The International Journal of Advanced Manufacturing Technology, 55:1 (2011), 11-22	23 ^[x]
24.	Eremeev, Anton V., “On Complexity of the Optimal Recombination for the Travelling Salesman Problem”, EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, 11th European Conference on Evolutionary Computation in Combinatorial Optimization (Torino, ITALY Date: APR 27-29, 2011), Sponsor(s): Human Genet Fdn; Univ Torino, Lecture Notes in Computer Science, 6622, eds. Book Editor(s): Merz, P; Hao, JK, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY, 2011, 215-225	2 ^[x]
25.	A. V. Eremeev, “Some fully polynomial time randomized approximation scheme based on an evolutionary algorithm”, Journal of Applied and Industrial Mathematics, 5:3 (2011), 322–330 http://link.springer.com/article/10.1134/S1990478911030021

2010
26.	A. Dolgui, A. V. Eremeev, M. Y. Kovalyov, P. M. Kuznetsov, “Multi-product lot sizing and scheduling on unrelated parallel machines”, IIE Transactions, 42:7 (2010), 514 - 524	21 ^[x]
27.	Guschinskaya, Olga; Gurevsky, Evgeny; Eremeev, Anton; et al., “Balancing Mass Production Machining Lines with Genetic Algorithms Source: ADVANCES IN PRODUCTION MANAGEMENT SYSTEMS: NEW CHALLENGES, NEW APPROACHES”, Advanced Production Management Systems Conference, APMS 2009 (Univ Bordeaux, IMS Lab, Bordeaux, FRANCE Date: SEP 21-23, 2009), IFIP Advances in Information and Communication Technology, 338, eds. Vallespir, B; Alix, T, SPRINGER-VERLAG BERLIN,, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY, 2010, 65-72

2009
28.	P. Borisovsky, A. Dolgui, A. Eremeev, “Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder”, European Journal of Operational Research, 195:3 (2009), 770-779	32 ^[x]

2008
29.	A. V. Eremeev, M. Ya. Kovalyov, P. M. Kuznetsov, “Approximate solution of the control problem of supplies with many intervals and concave cost functions”, Autom. Remote Control, 69:7 (2008), 1181–1187
30.	A. V. Eremeev, “On complexity of optimal recombination for binary representations of solutions”, Evolutionary Computation, 16:8 (2008), 127-147	15 ^[x]
31.	P. A. Borisovsky A. V. Eremeev, “Comparing Evolutionary Algorithms to the (1+1)-EA”, Theoretical Computer Science, 403:1 (2008), 33-41	19 ^[x]

2007
32.	A. Dolgui, A.V. Eremeev, V.S. Sigaev, “HBBA: hybrid algorithm for buffer allocation in tandem production lines”, Journal of Intelligent Manufacturing, 18:3 (2007), 411-420	54 ^[x]
33.	A. V. Eremeev, A. A. Romanova, V. V. Servakh, S. S. Chauhan, “Approximation solution of the supply management problem”, Journal of Applied and Industrial Mathematics, 1:4 (2007), 433–441

2005
34.	Chauhan S. S., Eremeev A. V., Romanova A. A., Servakh V. V., Woeginger G. J., “Approximation of the supply scheduling problem”, Operations Research Letters, 33:3 (2005), 249–254	22 ^[x]

2004
35.	P. A. Borisovskii, A. V. Eremeev, “Comparison of certain evolutionary algorithms”, Autom. Remote Control, 65:3 (2004), 357–362
36.	C.R.Reeves, A.V.Eremeev, “Statistical analysis of local search landscapes”, Journal of the Operational Research Society, 55:7 (2004), 687-693	33 ^[x]

2003
37.	Eremeev, AV; Reeves, CR, “On confidence intervals for the number of local optima”, APPLICATIONS OF EVOLUTIONARY COMPUTING EvoWorkshops 2003 Conference, Sponsor(s): EvoNet; European Commiss IST Programme (UNIV ESSEX, COLCHESTER, ENGLAND Date: APR 14-16, 2003), LECTURE NOTES IN COMPUTER SCIENCE, 2611, eds. Raidl, G; Cagnoni, S; Cardalda, JJR; et al., SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY, 2003, 224-235	14 ^[x]

2002
38.	Dolgui A., Eremeev A., Kolokolov A., Sigaev V., “A Genetic Algorithm for the Allocation of Buffer Storage Capacities in a Production Line with Unreliable Machines”, Journal of Mathematical Modelling and Algorithms, 1:2 (2002), 89-104	58 ^[x]
39.	Eremeev, A; Reeves, CR, “Non-parametric estimation of properties of combinatorial landscapes”, APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS Conference: EvoWorkshops 2002 (KINSALE, IRELAND Date: APR 03-04, 2002), Sponsor(s): EvoNet; Network Excellence Evolut Comp, LECTURE NOTES IN COMPUTER SCIENCE, 2279, eds. Book Editor(s): Cagnoni, S; Gottieb, J; Hart, E; et al., SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY, 2002, 31-40	17 ^[x]

2001
40.	Borisovsky, PA; Eremeev, AV, “On performance estimates for two evolutionary algorithms Source: APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS”, Book Editor(s): Boers, EJW, APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS EvoWorkshops 2000 (COMO, ITALY Date: APR 18-20, 2001), Sponsor(s): EvoNet, Network Excellence Evolut Comp, LECTURE NOTES IN COMPUTER SCIENCE, 2037, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY, 2001, 161-171

2000
41.	A. V. Eremeev, L. A. Zaozerskaya, A. A. Kolokolov, “The set covering problem: complexity, algorithms, and experimental investigations”, Diskretn. Anal. Issled. Oper., 7:2 (2000), 22–46
42.	A. V. Eremeev, “A genetic algorithm for the covering problem”, Diskretn. Anal. Issled. Oper., 7:1 (2000), 47–60
43.	Eremeev, AV, “On some approximation algorithms for dense vertex cover problem”, International Symposium on Operations Research (OR 99) 1999, OPERATIONS RESEARCH PROCEEDINGS 1999 (OTTO VON GUERICKE UNIV MAGDEBURG, MAGDEBURG, GERMANY Date: SEP 01-03, 1999), eds. Inderfurth, K; Schwodiauer, G; Domschke, W; Juhnke, F; Kleinschmidt, P; Wascher, G, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY, 2000, 58-62
44.	Eremeev, A.V., “Modeling and analysis of genetic algorithm with tournament selection(Conference Paper)”, 4th European Conference on Artificial Evolution, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Dunkerque; France; 3 November 1999 do 5 November 1999), 1829, eds. Lutton E.,Ronald E.,Schoenauer M.,Hao J.-K.,Fonlupt C., Springer Verlag, 2000, 84-95	6 ^[x]

Organisations

Registration to the website

Logotypes