RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Kovalenko, Yulia Viktorovna

Total publications: 21 (21)
in MathSciNet: 12 (12)
in zbMATH: 12 (12)
in Web of Science: 7 (7)
in Scopus: 16 (16)
Cited articles: 13
Citations in Math-Net.Ru: 4
Citations in Web of Science: 4
Citations in Scopus: 42

Number of views:
This page:1322
Abstract pages:1060
Full texts:268
References:119
Kovalenko, Yulia Viktorovna
Candidate of physico-mathematical sciences (2013)
Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
E-mail:
Keywords: scheduling theory, complexity theory, evolutionary algorithms, optimal recombination

Subject:

Discrete optimization, scheduling theory, evolutionary algorithms, complexity theory

   
Main publications:
  1. A. V. Eremeev, Yu. V. Kovalenko, “A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem”, Memetic Computing, 2019, 1–14 (Published online)  crossref  scopus
  2. A. V. Eremeev, Y. V. Kovalenko, “Genetic algorithm with optimal recombination for the asymmetric travelling salesman problem”, Lecture Notes in Computer Science, 10665 (2018), 341–349 , arXiv: 1706.06920  crossref  mathscinet  elib  scopus
  3. Y. V. Kovalenko, “On complexity of optimal recombination for flowshop scheduling problems”, Journal of Applied and Industrial Mathematics, 10:2 (2016), 220–231  mathnet  crossref  crossref  mathscinet  zmath  elib  elib  scopus
  4. A. V. Eremeev, J. V. Kovalenko, “Experimental evaluation of two approaches to optimal recombination for permutation problems”, Lecture Notes in Computer Science, 9595 (2016), 138–153  crossref  mathscinet  scopus
  5. A. V. Eremeev, J. V. Kovalenko, “Optimal recombination in genetic algorithms for combinatorial optimiyation problems part II”, Yugoslav Journal of Operations Research, 24:2 (2014), 165–186  crossref  mathscinet  zmath  elib  scopus
  6. A. V. Eremeev, J. V. Kovalenko, “Invited review optimal recombination in genetic algorithms for combinatorial optimization problems part I”, Yugoslav Journal of Operations Research, 24:1 (2014), 1–20  crossref  mathscinet  zmath  scopus
  7. 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  zmath  elib

http://www.mathnet.ru/eng/person69600
List of publications on Google Scholar
http://zbmath.org/authors/?q=ai:kovalenko.julia-viktorovna
https://mathscinet.ams.org/mathscinet/MRAuthorID/966551
http://elibrary.ru/author_items.asp?spin=2346-8377
http://orcid.org/0000-0003-4791-7011
https://publons.com/researcher/2010071
http://www.researcherid.com/rid/U-2310-2017
http://www.scopus.com/authid/detail.url?authorId=57112481500

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



   2019
1. A. Kononov, Yu. Kovalenko, “Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems”, Sib. elektron. matem. izv., 16 (2019), 249–257 , arXiv: 1811.11595  mathnet  crossref  zmath  adsnasa  isi  scopus
2. A. V. Eremeev, Yu. V. Kovalenko, “A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem”, Memetic Computing, 2019, 1–14 (Published online)  crossref  scopus
3. Yu. V. Kovalenko, A. O. Zakharov, “Pareto-based hybrid algorithms for the bicriteria asymmetric travelling salesman problem”, Lecture Notes in Computer Science, 11548 (2019), 358–373  crossref  scopus

   2018
4. A. O. Zakharov, Yu. V. Kovalenko, “Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria”, Vestn. S.-Peterburg. un-ta. Ser. 10. Prikl. matem. Inform. Prots. upr., 14:4 (2018), 378–392 , arXiv: 1812.00768  mathnet  crossref  adsnasa  isi  elib  scopus (cited: 2)
5. A. V. Eremeev, Y. V. Kovalenko, “Genetic algorithm with optimal recombination for the asymmetric travelling salesman problem”, Lecture Notes in Computer Science, 10665 (2018), 341–349 , arXiv: 1706.06920  crossref  mathscinet  elib  scopus (cited: 6)
6. A. O. Zakharov, Yu. V. Kovalenko, “Reduction of the Pareto Set in Bicriteria Asymmetric Traveling Salesman Problem”, Communications in Computer and Information Science, 871 (2018), 93–105 , arXiv: 1805.10606  crossref  adsnasa  elib  scopus (cited: 3)

   2017
7. A. Kononov, Y. Kovalenko, “An approximation algorithm for preemptive speed scaling scheduling of parallel jobs with migration”, Lecture Notes in Computer Science, 10556 (2017), 351–357  crossref  isi (cited: 1)  elib  scopus (cited: 1)
8. A. V. Eremeev, Y. V. Kovalenko, “On solving travelling salesman problem with vertex requisition”, Yugoslav Journal of Operations Research, 27:4 (2017), 415–426 , arXiv: 1703.03963  crossref  mathscinet  adsnasa  elib  scopus (cited: 2)

   2016
9. Y. V. Kovalenko, “On complexity of optimal recombination for flowshop scheduling problems”, Journal of Applied and Industrial Mathematics, 10:2 (2016), 220–231  mathnet  crossref  crossref  mathscinet  zmath  elib  elib  scopus
10. A. V. Eremeev, Y. V. Kovalenko, “Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Time”, 9th International Conference on Discrete Optimization and Operations Research (DOOR) (Vladivostok, RUSSIA, SEP 19-23, 2016), Lecture Notes in Computer Science, 9869, 2016, 298–308  crossref  mathscinet  zmath  isi (cited: 1)  elib  scopus
11. A. V. Eremeev, J. V. Kovalenko, “Experimental evaluation of two approaches to optimal recombination for permutation problems”, Lecture Notes in Computer Science, 9595 (2016), 138–153  crossref  mathscinet  scopus (cited: 3)
12. A. Kononov, Y. Kovalenko, “On speed scaling scheduling of parallel jobs with preemption”, Lecture Notes in Computer Science, 9869 (2016), 309–321  crossref  mathscinet  zmath  isi (cited: 2)  elib  scopus (cited: 2)
13. J. Kovalenko, “Optimal recombination in genetic algorithms for flowshop scheduling problems”, AIP Conference Proceedings, 1776 (2016), 050005 , 4 pp.  crossref  adsnasa  isi  elib  scopus
14. A. V. Eremeev, J. V. Kovalenko, “On multi-product lot-sizing and scheduling with multi-machine technologies”, Operations Research Proceedings 2014, 2016, 301–306  crossref  mathscinet  zmath  elib

   2014
15. 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  zmath  elib
16. A. V. Eremeev, J. V. Kovalenko, “Optimal recombination in genetic algorithms for combinatorial optimiyation problems part II”, Yugoslav Journal of Operations Research, 24:2 (2014), 165–186  crossref  mathscinet  zmath  elib  scopus (cited: 12)
17. A. V. Eremeev, J. V. Kovalenko, “Invited review optimal recombination in genetic algorithms for combinatorial optimization problems part I”, Yugoslav Journal of Operations Research, 24:1 (2014), 1–20  crossref  mathscinet  zmath  scopus (cited: 11)
18. A. V. Eremeev, J. V. Kovalenko, “Polynomially Solvable Cases of the Project Scheduling Problem with Changing Consumption and Supply Rates of Nonaccumulative Resources”, The Bulletin of Irkutsk State University. Series Mathematics ( Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika), 9 (2014), 26–38  zmath  elib

   2012
19. Yu. V. Kovalenko, “On the calendar planning problem with renewable resource”, Autom. Remote Control, 73:6 (2012), 1046–1055  mathnet  crossref  mathscinet  zmath  isi  elib  elib  scopus
20. 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  zmath  elib

   2011
21. 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

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