Ilya S. Bychkov
- Senior Research Fellow, Visiting Lecturer:HSE Campus in Nizhny Novgorod / Laboratory of Algorithms and Technologies for Networks Analysis (Nizhny Novgorod)
- Ilya S. Bychkov has been at HSE University since 2011.
Education and Degrees
- 2020
Candidate of Sciences* (PhD)
HSE University - 2014
Master's
HSE University
* Candidate of Sciences
According to the International Standard Classification of Education (ISCED) 2011, Candidate of Sciences belongs to ISCED level 8 - "doctoral or equivalent", together with PhD, DPhil, D.Lit, D.Sc, LL.D, Doctorate or similar. Candidate of Sciences allows its holders to reach the level of the Associate Professor.
According to the International Standard Classification of Education (ISCED) 2011, Candidate of Sciences belongs to ISCED level 8 - "doctoral or equivalent", together with PhD, DPhil, D.Lit, D.Sc, LL.D, Doctorate or similar. Candidate of Sciences allows its holders to reach the level of the Associate Professor.
Young Faculty Support Programme (Group of Young Academic Professionals)
Category "New Researchers" (2016)
Courses (2023/2024)
- Algorithms and Data Structures (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 2-4 module)Rus
- UI/UX Design (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 3 year, 3 module)Rus
- Past Courses
Courses (2022/2023)
- Algorithms and Data Structures 1 (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1-4 module)Rus
- UI/UX Design (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 3 year, 3 module)Rus
Courses (2021/2022)
- Algorithms and Data Structures 1 (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1, 2 module)Rus
- Algorithms and Data Structures 2 (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 3, 4 module)Rus
- Data Scraping using Python (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 4 module)Eng
- Research seminar "Fintech trends" (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 4 year, 1, 2 module)Rus
- UI/UX Design (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 3 year, 3 module)Rus
- Version control system (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 4 module)Eng
Courses (2020/2021)
- Algorithms and Data Structures (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 3, 4 module)Rus
- Algorithms and Data Structures 1 (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1, 2 module)Rus
- Introduction to Programming (Minor; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1, 2 module)Rus
- Version control system (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 4 module)Eng
Courses (2019/2020)
- Algorithms and Data Structures (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 1, 2 module)Rus
- Algorithms and Data Structures (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1, 2 module)Rus
- Introduction to Programming (Minor; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1, 2 module)Rus
Courses (2018/2019)
- Algorithms of Operations Research (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 3 year, 3, 4 module)Rus
- Introduction to Programming (Minor; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1, 2 module)Rus
- Software Systems Architecture Design (Bachelor’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 3 year, 3, 4 module)Rus
Dissertation for a degree of Candidate of Science
2020
I. S. Bychkov Models and algorithms for the cell formation problem
Publications11
- Article Mikhail V. Batsyn, Ekaterina K. Batsyna, Ilya S. Bychkov, Panos M. Pardalos. Vehicle assignment in site-dependent vehicle routing problems with split deliveries // Operational Research. 2021. Vol. 21. P. 399-423. doi
- Article Mikhail V. Batsyn, Ekaterina K. Batsyna, Ilya S. Bychkov. NP-completeness of cell formation problem with grouping efficacy objective // International Journal of Production Research. 2020. Vol. 58. No. 20. P. 6159-6169. doi
- Book Network Algorithms, Data Mining, and Applications. Springer Proceedings in Mathematics & Statistics / Ed. by I. S. Bychkov, V. A. Kalyagin, P. M. Pardalos, O. Prokopyev. Vol. 315. Springer, 2020. doi
- Book Springer Proceedings in Mathematics & Statistics / Ed. by I. S. Bychkov, V. A. Kalyagin, P. M. Pardalos, O. Prokopyev. Vol. 315: Network Algorithms, Data Mining, and Applications. NET 2018. Cham: Springer, 2020. doi
- Chapter Ilya Bychkov, Mikhail Batsyn. A Hybrid Approach for the Capacitated Vehicle Routing Problem with Time Windows, in: Optimization Problems and Their Applications. 7th International Conference, OPTA 2018, Omsk, Russia, July 8-14, 2018, Revised Selected Papers / Ed. by A. Eremeev, M. Khachay, Y. Kochetov, Pardalos P.. Springer, 2018. doi P. 66-81.
- Article Ilya Bychkov, Mikhail Batsyn. An efficient exact model for the cell formation problem with a variable number of production cells // Computers & Operations Research. 2018. No. 91. P. 112-120. doi
- Chapter Mikhail Batsyn, Ilya Bychkov, Larisa Komosko, Alexey Nikolaev. Tabu Search for Fleet Size and Mix Vehicle Routing Problem with Hard and Soft Time Windows, in: Computational Aspects and Applications in Large-Scale Networks. Springer Proceedings in Mathematics & Statistics Vol. 247. Springer, 2018. doi P. 3-18. doi
- Chapter Ilya Bychkov, Mikhail Batsyn, Panos M. Pardalos. Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem, in: Models, Algorithms, and Technologies for Network Analysis. Springer Proceedings in Mathematics & Statistics / Ed. by V. A. Kalyagin, A. I. Nikolaev, P. M. Pardalos, O. Prokopyev. Vol. 197. Springer, 2017. doi P. 11-26. doi
- Article Ilya Bychkov, Mikhail Batsyn, Panos M. Pardalos. Exact Model for the Cell Formation Problem // Optimization Letters. 2014. Vol. 8. No. 8. P. 2203-2210. doi
- Chapter Ilya Bychkov, Mikhail Batsyn, Pavel Sukhov. Heuristic Algorithm for the Cell Formation Problem, in: Models, Algorithms, and Technologies for Network Analysis / Ed. by Boris I. Goldengorin, Valery A. Kalyagin, Panos M. Pardalos. Vol. 59. NY : Springer, 2013. Ch. 4. P. 43-69.
- Chapter Mikhail Batsyn, Ilya Bychkov, Boris Goldengorin, Panos M. Pardalos, Pavel Sukhov. Pattern-Based Heuristic for the Cell Formation Problem in Group Technology, in: Models, Algorithms, and Technologies for Network Analysis / Ed. by B. I. Goldengorin, V. A. Kalyagin, P. M. Pardalos. Issue 32. NY : Springer, 2013. Ch. 2. P. 11-50.