Sciact
Toggle navigation
  • EN
  • RU

Sections:

  • Articles
  • Books
  • Conference attendances
  • Conference theses
  • Patents

Articles (28)

# Публикация
21 Dang D-C. , Eremeev A. , Lehre P.K.
Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys
In compilation Proceedings of the Genetic and Evolutionary Computation Conference. 2021. – C.1133 - 1141. – ISBN 978-1-4503-8350-9. DOI: 10.1145/3449639.3459398 OpenAlex
22 Eremeev A.V. , Kovalyov M.Y. , Pyatkin A.V.
On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances
Lecture Notes in Computer Science. 2020. P.40-45. DOI: 10.1007/978-3-030-53552-0_6 Scopus OpenAlex
23 Eremeev A.V. , Kovalenko Y.V.
A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem
Memetic Computing. 2020. V.12. P.23–36. DOI: 10.1007/s12293-019-00291-4 WOS Scopus OpenAlex
24 Eremeev A.V. , Spirov A.V.
Modeling SELEX for regulatory regions using Royal Road and Royal Staircase fitness functions
BioSystems. 2020. V.200. 104312 :1-12. DOI: 10.1016/j.biosystems.2020.104312 WOS Scopus РИНЦ OpenAlex
25 Eremeev A.V. , Kel’manov A.V. , Kovalyov M.Y. , Pyatkin A.V.
Maximum Diversity Problem with Squared Euclidean Distance
Lecture Notes in Computer Science. 2019. P.541-551. DOI: 10.1007/978-3-030-22629-9_38 Scopus OpenAlex
26 Eremeev A. , Kononov A. , Ziegler I.
On Complexity and Exact Solution of Production Groups Formation Problem
In compilation Optimization and Applications. OPTIMA 2018. Communications in Computer and Information Science. – Springer., 2019. – Т.974. – C.111-122. – ISBN 978-3-030-10933-2. DOI: 10.1007/978-3-030-10934-9_8 Scopus OpenAlex
27 Eremeev A.V. , Kovalyov M.Y. , Kuznetsov P.M.
Lot-size scheduling of a single product on unrelated parallel machines
Optimization Letters. 2018. V.14. N3. P.557-568. DOI: 10.1007/s11590-018-1307-1 WOS Scopus РИНЦ OpenAlex
28 Eremeev A.V. , Kelmanov A. , Pyatkin A.V.
On Complexity of Searching a Subset of Vectors with Shortest Average under a Cardinality Restriction
Communications in Computer and Information Science. 2017. V.661. P.51-57. DOI: 10.1007/978-3-319-52920-2_5 Scopus OpenAlex
  • « Previous
  • 1
  • 2
  • Next »
2   /  2   -  Total 28 records

Filter

Order

Field Direction

Columns

Reset