default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulia V. Kovalenko
Person information
- affiliation: Sobolev Institute of Mathematics, Novosibirsk, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j5]Julia V. Kovalenko
, Maria Yu. Sakhno:
Complexity and heuristic algorithms for speed scaling scheduling of parallel jobs with energy constraint. J. Comput. Appl. Math. 457: 116254 (2025)- 2022
- [j4]Christian Blum, Anton V. Eremeev, Julia V. Kovalenko:
Hybridizations of evolutionary algorithms with Large Neighborhood Search. Comput. Sci. Rev. 46: 100512 (2022) - [j3]Alexander V. Kononov, Yulia V. Zakharova:
Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion. J. Glob. Optim. 83(3): 539-564 (2022) - 2020
- [j2]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) - [j1]Alexander V. Kononov, Yulia V. Kovalenko:
Approximation algorithms for energy-efficient scheduling of parallel jobs. J. Sched. 23(6): 693-709 (2020)
Conference and Workshop Papers
- 2024
- [c13]Yulia V. Zakharova, Maria Yu. Sakhno:
Adaptive Genetic Algorithm with Optimized Operators for Scheduling in Computer Systems. Intelligent Information Processing (1) 2024: 317-328 - 2021
- [c12]Anton V. Eremeev, Yulia V. Kovalenko:
Optimal recombination and adaptive restarts improve GA performance on the asymmetric TSP. GECCO Companion 2021: 29-30 - [c11]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 - [c10]Alexander V. Kononov, Yulia V. Kovalenko:
Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint. MOTOR 2021: 267-279 - 2020
- [c9]Pavel A. Borisovsky, Yulia V. Kovalenko:
A Memetic Algorithm with Parallel Local Search for Flowshop Scheduling Problems. BIOMA 2020: 201-213 - [c8]Alexander V. Kononov, Yulia V. Kovalenko:
Makespan Minimization for Parallel Jobs with Energy Constraint. MOTOR 2020: 289-300 - 2019
- [c7]Yulia V. Kovalenko, Aleksey O. Zakharov:
Pareto-Based Hybrid Algorithms for the Bicriteria Asymmetric Travelling Salesman Problem. MOTOR 2019: 358-373 - 2017
- [c6]Alexander V. Kononov, Yulia V. Kovalenko:
An Approximation Algorithm for Preemptive Speed Scaling Scheduling of Parallel Jobs with Migration. LION 2017: 351-357 - [c5]Anton V. Eremeev, Yulia V. Kovalenko:
Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem. LSSC 2017: 341-349 - 2016
- [c4]Anton V. Eremeev, Yulia V. Kovalenko:
Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times. DOOR 2016: 298-308 - [c3]Alexander V. Kononov, Yulia V. Kovalenko:
On Speed Scaling Scheduling of Parallel Jobs with Preemption. DOOR 2016: 309-321 - [c2]Anton V. Eremeev, Julia V. Kovalenko:
Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems. EvoCOP 2016: 138-153 - 2014
- [c1]Anton V. Eremeev, Julia V. Kovalenko:
On Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies. OR 2014: 301-306
Informal and Other Publications
- 2018
- [i7]Aleksey O. Zakharov, Yulia V. Kovalenko:
Reduction of the Pareto Set in Bicriteria Asymmetric Traveling Salesman Problem. CoRR abs/1805.10606 (2018) - [i6]Alexander V. Kononov, Yulia V. Kovalenko:
Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems. CoRR abs/1811.11595 (2018) - [i5]Aleksey O. Zakharov, Yulia V. Kovalenko:
Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria. CoRR abs/1812.00768 (2018) - 2017
- [i4]Anton V. Eremeev, Yulia V. Kovalenko:
On Solving Travelling Salesman Problem with Vertex Requisitions. CoRR abs/1703.03963 (2017) - [i3]Anton V. Eremeev, Yulia V. Kovalenko:
Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem. CoRR abs/1706.06920 (2017) - 2014
- [i2]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
- [i1]Anton V. Eremeev, Julia V. Kovalenko:
Optimal Recombination in Genetic Algorithms. CoRR abs/1307.5519 (2013)
Coauthor Index
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-16 20:30 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:
