RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Eremeev, Anton Valentinovich

Total publications: 42 (42)
in MathSciNet: 24 (24)
in zbMATH: 23 (23)
in Web of Science: 21 (21)
in Scopus: 30 (30)
Cited articles: 35
Citations in Math-Net.Ru: 39
Citations in Web of Science: 184
Citations in Scopus: 347

Number of views:
This page:1149
Abstract pages:5644
Full texts:2230
References:308
Eremeev, Anton Valentinovich
Associate professor
Doctor of physico-mathematical sciences (2013)
Speciality: 05.13.17 (Theoretical foundation for informatics)
E-mail:
Website: http://iitam.omsk.net.ru/~eremeev/papers_r.htm

http://www.mathnet.ru/eng/person27752
List of publications on Google Scholar
http://zbmath.org/authors/?q=ai:eremeev.anton-v
https://mathscinet.ams.org/mathscinet/MRAuthorID/659333
http://elibrary.ru/author_items.asp?spin=5541-4410
http://orcid.org/0000-0001-5289-7874
http://www.researcherid.com/rid/E-8775-2013
http://www.scopus.com/authid/detail.url?authorId=36018145800

Full list of publications:
| by years | by types | by times cited in WoS | by times cited in Scopus | scientific publications | common list |


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

   2018
2. 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)  crossref  isi  scopus

   2017
3. 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  mathnet  crossref  mathscinet  isi (cited: 4)  elib  elib  scopus (cited: 8)
4. 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  mathnet  crossref  crossref  elib  scopus
5. 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  crossref  isi  scopus (cited: 2)
6. 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  crossref  scopus (cited: 2)
7. Eremeev, A.V., Kovalenko, Y.V., “On solving travelling salesman problem with vertex requisitions”, Yugoslav Journal of Operations Research, 2017, 415-426  crossref  scopus (cited: 2)
8. 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  crossref  mathscinet  scopus (cited: 3)
9. 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  crossref  zmath  isi (cited: 7)  scopus (cited: 22)

   2016
10. 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  mathnet  crossref  crossref  isi  elib  elib  scopus
11. 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)  crossref  mathscinet  scopus (cited: 3)

   2014
12. 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  crossref  mathscinet  zmath  scopus (cited: 11)
13. 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  crossref  mathscinet  zmath  scopus (cited: 13)
14. 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  mathnet

   2013
15. 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  crossref  mathscinet  zmath  scopus (cited: 12)

   2012
16. 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  mathnet  mathscinet  elib
17. A. V. Eremeev, “Genetic algorithm with tournament selection as a local search method”, J. Appl. Industr. Math., 6:3 (2012), 286–294  mathnet  crossref  mathscinet  elib  elib

   2011
18. A. V. Eremeev, Ju. V. Kovalenko, “On scheduling with technology based machines grouping”, Diskretn. Anal. Issled. Oper., 18:5 (2011), 54–79  mathnet  mathscinet  zmath  elib
19. A. V. Eremeev, “The complexity of optimal recombination for the traveling salesman problem”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 27–40  mathnet  mathscinet  zmath  elib
20. B. Doerr, A. Eremeev, F. Neumann, M. Theile, C. Thyssen, “Evolutionary algorithms and dynamic programming”, Theoretical Computer Science, 412 (2011), 6020-6035  crossref  mathscinet  zmath  isi (cited: 7)  elib (cited: 10)  scopus (cited: 10)
21. 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  crossref  isi (cited: 17)  scopus (cited: 25)
22. 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  crossref  mathscinet  isi  scopus (cited: 2)
23. 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  mathnet  crossref  mathscinet  zmath  elib  elib  scopus

   2010
24. 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  crossref  isi (cited: 16)  elib (cited: 9)  scopus (cited: 18)
25. 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  crossref  isi  scopus

   2009
26. 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  crossref  zmath  isi (cited: 17)  scopus (cited: 23)

   2008
27. 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  mathnet  crossref  mathscinet  zmath  isi (cited: 2)  elib  elib  scopus (cited: 2)
28. A. V. Eremeev, “On complexity of optimal recombination for binary representations of solutions”, Evolutionary Computation, 16:8 (2008), 127-147  crossref  isi (cited: 8)  elib (cited: 8)  scopus (cited: 8)
29. P. A. Borisovsky A. V. Eremeev, “Comparing Evolutionary Algorithms to the (1+1)-EA”, Theoretical Computer Science, 403:1 (2008), 33-41  crossref  mathscinet  zmath  isi (cited: 7)  elib (cited: 5)  scopus (cited: 12)

   2007
30. 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  crossref  isi (cited: 40)  scopus (cited: 50)
31. 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  mathnet  crossref  mathscinet  zmath  elib  scopus (cited: 6)

   2005
32. 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), 249254  crossref  mathscinet  zmath  isi (cited: 14)  elib (cited: 20)  scopus (cited: 21)

   2004
33. P. A. Borisovskii, A. V. Eremeev, “Comparison of certain evolutionary algorithms”, Autom. Remote Control, 65:3 (2004), 357–362  mathnet  crossref  mathscinet  zmath  isi (cited: 1)  elib (cited: 2)  scopus (cited: 2)
34. C.R.Reeves, A.V.Eremeev, “Statistical analysis of local search landscapes”, Journal of the Operational Research Society, 55:7 (2004), 687-693  crossref  zmath  isi (cited: 24)  scopus (cited: 28)

   2003
35. 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  crossref  zmath  isi (cited: 9)

   2002
36. 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  crossref  mathscinet  zmath  scopus (cited: 61)
37. 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  crossref  mathscinet  zmath  isi (cited: 10)

   2001
38. 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  crossref  mathscinet  zmath  isi (cited: 1)  scopus (cited: 1)

   2000
39. 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  mathnet  mathscinet  zmath  elib
40. A. V. Eremeev, “A genetic algorithm for the covering problem”, Diskretn. Anal. Issled. Oper., 7:1 (2000), 47–60  mathnet  mathscinet  zmath
41. 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  crossref  mathscinet  zmath
42. 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  crossref  zmath

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020