|
Список публикаций:
|
|
Цитирования (Crossref Cited-By Service + Math-Net.Ru) |
|
1. |
Borisovsky P., Delorme X., and Dolgui A., “Genetic algorithm for balancing reconfigurable machining lines”, Computers and Industrial Engineering, 66:3 (2013), 541-547
|
38
[x]
|
2. |
Borisovsky P., Delorme X., and Dolgui A., “Balancing reconfigurable machining lines via a set partitioning model”, International Journal of Production Research, 52:13 (2014), 4026-4036
|
36
[x]
|
3. |
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
|
31
[x]
|
4. |
P. A. Borisovsky A. V. Eremeev, “Comparing Evolutionary Algorithms to the (1+1)-EA”, Theoretical Computer Science, 403:1 (2008), 33-41
|
19
[x]
|
5. |
P. Borisovsky, A. Dolgui, S. Kovalev, “Algorithms and implementation of a set partitioning approach for modular machining line design”, Computers & Operations Research, 2012
|
18
[x]
|
6. |
P. A. Borisovsky, A. V. Eremeev, J. Kallrath, “Multi-product continuous plant scheduling: combination of decomposition, genetic algorithm, and constructive heuristic”, International Journal of Production Research, 2019 (to appear)
|
14
[x]
|
7. |
P. Borisovsky, A. Dolgui, S. Kovalev, “Modelling transfer line design problem via a set partitioning problem”, Optimization letters, 6:5 (2012), 915-926
|
12
[x]
|
8. |
П. А. Борисовский, А. В. Еремеев, “О сравнении некоторых эволюционных алгоритмов”, Автомат. и телемех., 2004, № 3, 3–9 ; P. A. Borisovskii, A. V. Eremeev, “Comparison of certain evolutionary algorithms”, Autom. Remote Control, 65:3 (2004), 357–362
|
10
[x]
|
9. |
Borisovsky P.A., Eremeev A.V., Grinkevich E.B., Klokov S.A., Vinnikov A.V., “Trading hubs construction for electricity markets”, Optimization in the Energy Industry, eds. J. Kallrath, P.M. Pardalos, S. Rebennack, M. Scheidt, Springer, 2009, 29-58
|
6
[x]
|
10. |
P. Borisovsky, A. Eremeev, S. Hrushev, V. Teplyakov, M. Vorozhtsov, “On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths”, Yugoslav Journal of Operations Research, 29:1 (2018), 93-112
|
2
[x]
|
11. |
P. A. Borisovsky, A. V. Eremeev, J. Kallrath, “On hybrid method for medium-term multi-product continuous plant scheduling”, 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON), IEEE, 2017, 42-47
|
1
[x]
|
12. |
Borisovsky P.A., Eremeev A.V., Grinkevich E.B., Klokov S.A., Kosarev N.A., “Trading hubs construction in electricity markets using evolutionary algorithms”, Pattern Recognition and Image Analysis, 24:2 (2014), 270-282
|
1
[x]
|
13. |
P. Borisovsky, “Exact Solution of One Production Scheduling Problem”, Optimization Problems and Their Applications. OPTA 2018. Communications in Computer and Information Science, 871, eds. Eremeev A., Khachay M., Kochetov Y., Pardalos P., Springer, 2018, 56-67 |
14. |
П. А. Борисовский, А. В. Еремеев, “Построение расписаний многопродуктового производства с использованием целочисленного линейного программирования и эволюционных вычислений”, Информационные технологии, 21:6 (2015), 412-421 |
15. |
Борисовский П.А., “Генетический алгоритм для одной задачи составления производственного расписания с переналадками”, Труды XIV Байкальской международной школы-семинара “Методы оптимизации и их приложения” (Северобайкальск, июль, 2008), 4, ИСЭМ СО РАН., Иркутск, 2008, 304-311 |
16. |
Borisovsky P.A., Eremeev A.V., “A comparative study of some evolutionary algorithms”, Electronic Notes in Discrete Mathematics, 27 (2006), 7-8 |
17. |
Borisovsky P.A., Eremeev A.V., “A Study on Performance of the (1+1)-Evolutionary Algorithm”, Foundations of Genetic Algorithms 7, eds. K. De Jong, R. Poli, J. Rowe, Morgan Kaufmann, 2003, 271-287 |
18. |
Borisovsky P.A., Zavolovskaya M.S., “Experimental Comparison of Two Evolutionary Algorithms for the Independent Set Problem”, Applications of evolutionary computing: Proc. of EvoWorkshops 2003., eds. S.Cagnoni et al., Springer Verlag, 2003, 154-164 |
19. |
П. А. Борисовский, “Параллельный алгоритм «иди с победителями» для некоторых задач составления расписаний”, Дискретн. анализ и исслед. опер., 30:4 (2023), 5–23 ; P. A. Borisovsky, “A parallel “Go with the winners” algorithm for some scheduling problems”, J. Appl. Industr. Math., 17:4 (2023), 687–697 |
|