Mikhail Vladimirovich Batsyn
- Research Fellow:HSE Campus in Nizhny Novgorod / Laboratory of Algorithms and Technologies for Networks Analysis (Nizhny Novgorod)
- Mikhail Vladimirovich Batsyn has been at HSE University since 2015.
Degrees
Candidate of Sciences* (PhD)
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 Lecturers" (2009-2011)
Courses (2023/2024)
- Discrete optimization and operations research (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1, 2 module)Eng
- Modern operations research methods (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 3 module)Eng
- Project Seminar (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 3 module)Rus
- Past Courses
Courses (2022/2023)
- Discrete optimization and operations research (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1, 2 module)Eng
- Modern operations research methods (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 3 module)Eng
- Project Seminar (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 2 module)Rus
Courses (2021/2022)
- Discrete optimization and operations research (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1, 2 module)Eng
- Modern Methods of Decision Making (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 3 module)Eng
- Project Seminar (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 3 module)Rus
Courses (2020/2021)
- Discrete Optimization (Postgraduate course’s programme; 2 year, 1, 2 semester)Rus
- Discrete optimization and operations research (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1, 2 module)Eng
- Project Seminar (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 3 module)Rus
Courses (2019/2020)
- Discrete optimization and operations research (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 1 year, 1, 2 module)Eng
- Project Seminar (Master’s programme; Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod); 2 year, 3 module)Rus
Conferences
2021
Mikhail Batsyn. Applied optimization problems. Higher School of Economics and Huawei company seminar. 16 March 2021. Nizhny Novgorod. Russia.
2020
Irina Utkina, Olga Bukanova, Mikhail Batsyn. Fast heuristic for Vehicle Routing Problem on Trees. International Conference Mathematical Optimization Theory and Operations Research, MOTOR-2020. 6-10 July 2020. Novosibirsk. Russia.
Mikhail Batsyn. On some classical and applied combinatorial optimization problems. Huawei workshop "Parallel & Graph Computing, Math Libraries and Algorithms". 21 October 2020. Nizhny Novgorod. Russia.
2018
Mikhail Batsyn. On NP-hardness of the Cell Formation Problem. 8th International Conference on Network Analysis, NET-2018. 18-19 May 2018. Moscow. Russia.
Alexey Nikolaev, Mikhail Batsyn. Branch-and-bound algorithm for Symmetric Travelling Salesman Problem. International Workshop on Combinatorial Algorithms, IWOCA-2018. July 16-19 2018. Singapore.
2017
Mikhail Batsyn. Vehicle Assignment in Site-Dependent Vehicle Routing Problems with Split Deliveries. International Conference of Optimization and Decision Science ODS2017, XLVII Annual Meeting of AIRO - Italian Operations Research Society. 4-7 September 2017. Sorrento. Italy.
2016
Mikhail Batsyn. Tutorial: Optimization problems in the transportation logistics. Discrete Optimization and Operations Research, DOOR-2016. 19-23 September 2016. Vladivostok, Russky Island. Russia.
Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna. A branch and bound algorithm for a fractional 0-1 programming problem. Discrete Optimization and Operations Research, DOOR-2016. 19-23 September 2016. Vladivostok, Russky Island. Russia.
Mikhail Batsyn. Optimization problems in manufacturing and logistics. Information technologies in the service of the military-industrial complex, ITOPK-2016. 17-20 May 2016. Chelyabinsk. Russia.
Mikhail Batsyn. A branch and bound algorithm for a fractional 0-1 programming problem. Workshop on Critical and collective effects in graphs and networks. 25-29 April 2016. MIPT, Moscow.
2015
Mikhail Batsyn, Larisa Komosko, Alexey Nikolaev, Pablo San Segundo. Applying bitwise operations for solving combinatorial optimization problems. Workshop on Clustering and Search techniques in large scale networks. 23-25 October 2015. Higher School of Economics, Nizhny Novgorod, Russia.
Mikhail Batsyn, Alexander Ponomarenko. Heuristic for Site-Dependent Truck and Trailer Routing Problem with Soft and Hard Time Windows and Split Deliveries. International Workshop on Machine learning, Optimization and big Data - MOD-2015. 21-23 July 2015. Taormina - Sicily. Italy.
Mikhail Batsyn. Applied Optimization Problems. Joint seminar of LATNA lab. and Yandex company. 6 April 2015. Yandex Co. office (M. "Park Kultury"). Moscow. Russia.
Mikhail Batsyn, Alexey Nikolaev, Pablo San Segundo. An efficient approach to the protein structure alignment problem. World Congress on Global Optimization WCGO 2015. 22-25 February 2015. University of Florida. Gainesville. Florida. USA.
2014
Mikhail Batsyn, Ilya Bychkov, Panos M. Pardalos, Pavel Sukhov. Multi-start local search heuristic for the cell formation problem. The 20th Conference of the International Federation of Operational Research Societies IFORS-2014. 13-18 July 2014. Barcelona. Spain.
Mikhail Batsyn, Alexander Ponomarenko. Heuristic for Truck and Trailer Routing Problem. XVI Baikal International school-seminar "Optimization Methods and Its Applications". 30 June - 6 July 2014. island Ol'khon, lake Baikal, Russia.
Mikhail Batsyn, Alexey Nikolaev, Panos M. Pardalos, Pablo San Segundo. A simple approach for essential improvement of the state-of-art exact algorithms for the maximum clique problem. Conference on Optimization Control and Applications in the Information Age. 15-20 June 2014. Chalkidiki. Greece.
2013
Mikhail Batsyn, Valery Kalyagin. A general axiomatics for power indicies without anonymity axiom. 26th European Conference on Operational Research. 1-4 July 2013. Sapienza University of Rome. Rome. Italy.
Mikhail Batsyn, Boris Goldengorin, Panos M. Pardalos, Pavel Sukhov. Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times. The 3rd International Conference on Network Analysis. 7-9 May 2013. Higher School of Economics. Nizhny Novgorod. Russia.
Mikhail Batsyn, Evgeny Maslov, Panos M. Pardalos. An Efficient Branch and Bound Algorithm for Protein Matching Problem. 2nd International Conference on Computational Biomedicine. 24-26 Jan 2013. University of Florida. Gainesville. USA.
2012
Mikhail Batsyn, Ilya Bychkov, Boris Goldengorin, Panos M. Pardalos. Tolerance-based Algorithm for the Assignment Problem. Constructive Nonsmooth Analysis and Related Topics. 18-23 June 2012. Euler International Mathematical Institute. Saint-Petersburg. Russia.
Mikhail Batsyn, Boris Goldengorin, Evgeny Maslov, Panos M. Pardalos. Tolerance Based Algorithms for the Asymmetric Capacitated VRP. 3rd Conference on Optimization Methods and Software. 13-17 May 2012. Chania. Crete. Greece.
Mikhail Batsyn, Boris Goldengorin, Panos M. Pardalos. Applying Tolerances to the Asymmetric Capacitated Vehicle Routing Problem. The 2nd International Conference on Network Analysis. 7-9 May 2012. Higher School of Economics. Nizhny Novgorod. Russia.
2011
Mikhail Batsyn, Valery Kalyagin. On the distribution of the sum of random variables with a mixed-uniform density and mass function. The 1st International Conference on Network Analysis. 14-16 Dec 2011. University of Florida. Gainesville. Florida. USA.
20211
20202
- Chapter Irina Utkina, Olga Bukanova, Mikhail V. Batsyn. Fast Heuristic for Vehicle Routing Problem on Trees, in: Mathematical Optimization Theory and Operations Research. 19th International Conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020, Revised Selected Papers Vol. 1275: Communications in Computer and Information Science . Springer, 2020. P. 379-386. 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
20186
- 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.
- Chapter Ponomarenko A., Irina Utkina, Mikhail Batsyn. A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search, in: Computational Aspects and Applications in Large-Scale Networks. Springer Proceedings in Mathematics & Statistics Vol. 247. Springer, 2018. doi P. 197-203. doi
- Article Irina E. Utkina, Mikhail V. Batsyn, Ekaterina K. Batsyna. A branch-and-bound algorithm for the cell formation problem // International Journal of Production Research. 2018. Vol. 56. No. 9. P. 3262-3273. doi
- 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 Alexey Nikolaev, Mikhail Batsyn. Branch-and-bound algorithm for Symmetric Travelling Salesman Problem, in: Combinatorial Algorithms. 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018. Lecture Notes in Computer Science Vol. 10979. Springer, 2018. doi P. 311-322. 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
20173
- Article Pablo San Segundo ., Jorge Artieda .., Mikhail Batsyn, Panos M. Pardalos. An enhanced bitstring encoding for exact maximum clique search in sparse graphs // Optimization Methods and Software. 2017. Vol. 32. No. 2. P. 312-335. 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 Уткина И. Е., Бацын М. В. Алгоритм ветвей и границ для задачи о формировании производственных ячеек // Программные продукты, системы и алгоритмы. 2017. № 4. С. 1-10.
20165
- Chapter Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna. A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem, in: Discrete Optimization and Operations Research/9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings / Ed. by Y. Kochetov, Khachay, M., V. Beresnev, E. Nurminski, P. M. Pardalos. Springer, 2016. doi P. 244-255. doi
- Chapter Irina Utkina, Mikhail Batsyn. A Branch and Bound Algorithm for the Cell Formation Problem, in: Models, Algorithms and Technologies for Network Analysis, Springer Proceedings in Mathematics & Statistics / Ed. by V. A. Kalyagin, Petr A. Koldanov, P. M. Pardalos. Vol. 156. Switzerland : Springer, 2016. doi P. 115-124. doi
- Article Larisa Komosko, Mikhail Batsyn, Pablo San Segundo ., Panos M. Pardalos. A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations // Journal of Combinatorial Optimization. 2016. No. 4. P. 1665-1677. doi
- Article San Segundo P., Nikolaev A., Batsyn M., Pardalos P.M. Improved Infra-Chromatic Bound for Exact Maximum Clique Search // Informatica. 2016. Vol. 27. No. 2. P. 463-487. doi
- Article San Segundo P., Lopez A., Mikhail Batsyn, Alexey Nikolaev, Pardalos P. M. Improved initial vertex ordering for exact maximum clique search // Applied Intelligence. 2016. Vol. 45. No. 3. P. 868-880. doi
20156
- Preprint Batsyn M.V., Kalyagin V.A., Tulyakov D. An efficient approach to the protein structure alignment problem / Институт прикладной математики им. М.В. Келдыша Российской академии наук. 2015. No. 91.
- Chapter Mikhail Batsyn, Alexander Ponomarenko. Heuristic for Site-Dependent Truck and Trailer Routing Problem with Soft and Hard Time Windows and Split Deliveries, in: Machine Learning, Optimization, and Big Data. First International Workshop, MOD 2015, Taormina, Sicily, Italy, July 21-23, 2015. Lecture Notes in Computer Science / Ed. by P. M. Pardalos, M. Pavone, G. Farinella, V. Cutello. Vol. 9432. Springer, 2015. doi P. 65-79. doi
- Article San Segundo P., Nikolaev A., Batsyn M. Infra-chromatic bound for exact maximum clique search // Computers & Operations Research. 2015. Vol. 64. P. 293-303. doi
- Article Nikolaev A., Batsyn M., San Segundo P. Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem // Lecture Notes in Computer Science. 2015. Vol. 8994. P. 275-280. doi
- Article Кочетуров А. А., Бацын М. В., Пардалос П. О. Динамика кластерных структур в сетях фондовых рынков // Журнал Новой экономической ассоциации. 2015. Т. 4. № 28. С. 12-30.
- Article Комоско Л. Ф., Бацын М. В. Эффективная раскраска графа с помощью битовых операций // Информационные технологии. 2015. № 7. С. 488-494.
201412
- Article Pavel Sukhov, Mikhail Batsyn, Petr Terentev. A Dynamic Programming Heuristic for Optimizing Slot Sizes in a Warehouse // Procedia Computer Science. 2014. Vol. 31. P. 773-777. doi
- Book Constructive Nonsmooth Analysis and Related Topics / Ed. by .. Vladimir Demyanov, Panos M. Pardalos, Mikhail Batsyn. Vol. 87. NY : Springer, 2014.
- Article Anton Kocheturov, Mikhail Batsyn, Panos M. Pardalos. Dynamics of cluster structures in a financial market network // Physica A: Statistical Mechanics and its Applications. 2014. Vol. 413. P. 523-533. 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
- Article Mikhail Batsyn, Alexander Ponomarenko. Heuristic for a Real-life Truck and Trailer Routing Problem // Procedia Computer Science. 2014. Vol. 31. P. 778-792. doi
- Article Mikhail Batsyn, Boris Goldengorin, Evgeny Maslov, Panos M. Pardalos. Improvements to MCS algorithm for the maximum clique problem // Journal of Combinatorial Optimization. 2014. Vol. 27. No. 2. P. 397-416. doi
- Article Pablo San Segundo ., Alvaro Lopez ., Mikhail Batsyn. Initial Sorting of Vertices in the Maximum Clique Problem Reviewed // Lecture Notes in Computer Science. 2014. Vol. 8426. No. DOI 10.1007/978-3-319-09584-4_12. P. 111-120.
- Article Mikhail Batsyn, Boris Goldengorin, Panos M. Pardalos, Pavel Sukhov. Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time // Optimization Methods and Software. 2014. Vol. 29. No. 5. P. 955-963. doi
- Article Evgeny Maslov, Mikhail Batsyn, Panos M. Pardalos. Speeding up branch and bound algorithms for solving the maximum clique problem // Journal of Global Optimization. 2014. Vol. 59. No. 1. P. 1-21. doi
- Chapter Кочетуров А. А., Бацын М. В., Пардалос П. О., Гольденгорин Б. И. Анализ финансовых рынков средствами модели о p-медианах // В кн.: XIV Апрельская международная научная конференция по проблемам развития экономики и общества: в 4-х книгах. Книга 4 / Отв. ред.: Е. Г. Ясин. М. : Издательский дом НИУ ВШЭ, 2014. С. 394-402.
- Chapter Комоско Л.Ф., Бацын М.В. Быстрый алгоритм для решения задачи о раскраске графа с использованием битовых операций // В кн.: Труды 38-й конференции "Информационные технологии и системы - 2014". Н. Новгород : ИППИ РАН, 2014. С. 432-438.
- Chapter Бацын М.В., Пономаренко А.А. Эвристика для решения задачи маршрутизации тягачей с прицепами, возникающей в реальной практике // В кн.: Труды 38-й конференции "Информационные технологии и системы - 2014". Н. Новгород : ИППИ РАН, 2014. С. 440-449.
20137
- Chapter Mikhail Batsyn, Valery Kalyagin. An Analytical Expression for the Distribution of the Sum of Random Variables with Mixed Uniform Density and Mass Function, 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. 3. P. 51-63.
- 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, Boris Goldengorin, Pavel Sukhov, Panos M. Pardalos. Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times, 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. 2. P. 11-27.
- 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.
- Chapter Evgeny Maslov, Mikhail Batsyn, Panos M. Pardalos. Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements, 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. 7. P. 93-99.
- Chapter Mikhail Batsyn, Boris Goldengorin, Anton Kocheturov, Panos M. Pardalos. Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing 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. 1. P. 1-10.
- Article Бацын М. В. Рецензия на статью "Статистические исследования эффективности применения алгоритма Cвира" // Логистика. 2013. № 5. С. 26-26.
20121
20112
- Article Batsyn M. V., Kalyagin V. A. Power Index Axiomatics in the Problem of Voting with Quota / Пер. с рус. // Automation and Remote Control. 2011. Vol. 72. No. 3. P. 600-614.
- Article Бацын М. В., Калягин В. А. Аксиоматика индексов влияния в задаче голосования с квотой // Автоматика и телемеханика. 2011. № 3. С. 145-160.
20102
- Chapter Batsyn M. V., Kalyagin V. A. Default risk estimation in reinsurance contracts on the base of simulation model, in: History of accounting, buisness administration doctrines and development of new methods of management in Italy and Russia, 2010 / Ed. by S. Terzani, O. Kozyrev. Milan : Rirea, 2010. P. 8-20.
- Chapter Бацын М. В., Калягин В. А. Об одном общем подходе к измерению влияния в коллективных органах принятия решений // В кн.: X Международная научная конференция по проблемам развития экономики и общества: в 3 кн. / Отв. ред.: Е. Г. Ясин. Кн. 2. М. : Издательский дом ГУ-ВШЭ, 2010.
20093
- Article Бацын М. В., Калягин В. А. Вычисление индексов влияния на основе одной вероятностной модели // Бизнес-информатика. 2009. № 1. С. 33-40.
- Preprint Бацын М. В., Калягин В. А. Об аксиоматическом определении общих индексов влияния в задаче голосования с квотой / Высшая школа экономики. Серия WP7 "Математические методы анализа решений в экономике, бизнесе и политике". 2009. № 4.
- Article Бацын М. В., Калягин В. А. Об одном случае вычисления распределения суммарных выплат в задаче перестрахования индивидуальных рисков // Вестник Тверского государственного университета. Серия: Прикладная математика. 2009. № 3. С. 81-100.
20081
20061
20051
Research projects
2022-2024, RSF grant 22-11-00073 "Analysis of uncertainty and optimization for data mining models", co-investigator
2021-2022, R&D project with Huawei "Optimization of Tensor Computation Graphs", principal developer
2017-2019, RSF grant 17-71-10107 «Development and analysis of algorithms for applied vehicle routing problems with a large number of constraints», principal investigator
2017-2018, RSF grant 14-41-00039 «Clustering and search techniques in large scale networks», co-investigator
2015-2017, RHF grant 15-32-01052 «The application of robust procedures to the analysis of the structural characteristics of stock markets», co-investigator
2014-2017, R&D project with retail company "Development of a software for solving an applied vehicle routing problem", principal developer.
2014-2016, RFBR grant 14-01-00807 «Theoretical basis of the network analysis of stock markets», co-investigator
2014-2015, RSF grant 14-41-00039 «Clustering and search techniques in large scale networks», co-investigator
2014-2015, RF government grant 11.G34.31.0057 «Information and communication technologies and computational algorithms for analysis of complex networks», co-investigator
2011-2013, RF government grant 11.G34.31.0057 «Information and communication technologies and computational algorithms for analysis of complex networks», co-investigator
2011-2012, HSE science fund grant 11-04-0008 «Calculus of tolerances in combinatorial optimization problems: theory and algorithms», co-investigator
2010-2011, R&D project with a light machinery manufacturer: «Automated system for building the production schedule of Legmach plant», developer
2010-2010, CFR (Center of Fundamental Research in HSE) grant 61.1 «Development of methods and technologies for situational modeling», co-investigator
2008-2009, RHF grant 08-02-00231а «Comparative analysis of behavioral premises in collective actions theory», co-investigator
2007-2008, HSE Academic Foundation grant 06-06-0002 «Development of power indices system taking into account agents' preferences for coalitions creation», co-investigator
Employment history
CV
Mar 2013 – Present
Senior research fellow in LATNA laboratory, NRU Higher School of Economics
Managing a team of 4 researchers. State-of-art problems in optimization.
Sep 2014 – Dec 2017
Chief developer and team leader. The project with a big retail-company devoted to the development of the software for solving an applied vehicle routing problem.
C++ development of the module for building optimal routes for goods delivery to stores. Project plan management.
Nov 2011 – Feb 2013
Research fellow in LATNA laboratory, NRU Higher School of Economics
Managing a team of 4 researchers. State-of-art problems in optimization.
Nov 2009 – Nov 2010
Junior research fellow in TAPRADESS laboratory, NRU Higher School of Economics
Research in actuarial mathematics, collective choice theory, collective action theory, operations research.
Sep 2013 – Present
Associate professor of Applied Mathematics and Informatics department, NRU Higher School of Economics
Giving lectures on courses of: Algorithms of Operations Research, State-of-art Problems of Operations Research, Discrete Optimization.
Sep 2009 – Sep 2013
Assistant professor of Applied Mathematics and Informatics department, NRU Higher School of Economics
Giving lectures on courses of: Operations Research, Discrete Mathematics, PC Architecture, Actuarial Mathematics, Introduction to the speciality of applied mathematics and informatics.
Feb 2010 – Nov 2011
Leading software developer, StreamScape, LLC
Development of distributed service-oriented software system. HTTP-client development. Services development.
Mar 2009 – Feb 2010
System software developer, Auriga, Inc
Development of LinuxWorks (hard real time operating system): TCP/IP stack, standard utilities and libraries, drivers, kernel.
Oct 2008 – Mar 2009
Team leader, Auriga, Inc
Project plan management. Development in C/C++ of TCP-servers working via its own secure protocol. Working with TCP: TCP window, TCP tuning, Nagel algorithm, Eifel algorithm. Development in Perl of an application for automated testing.
Feb 2007 – Oct 2008
Team leader, Mera
Project plan management. Development in C/C++ of multi-threaded simulators for different devices in GSM networks. ASN.1 and XDR data processing. Development of GUI in Java.
Nov 2003 – Feb 2007
Software developer, Mera
Development in C/C++ of multi-threaded simulators for different devices in GSM networks. ASN.1 and XDR data processing. Development of GUI in Java.
Jul 2006 – Aug 2007
Intern, IntelStudio 2006 project
Operating systems and hardware. Development of threads library in Linux. Development of a small shell for Linux. Modification of Linux kernel. Improvement of a file system on Linux. Implementation of virtual memory mechanism for a simple processor simulator. Smashing the stack of a web-server.
Internet Search Possible without Search Engines
Specialists from the HSE’s Nizhny Novgorod campus plan to create a new system of structuring data and accounting of webpages. The Laboratory of Algorithms and Technologies for Networks Analysis has won a grant from the Russian Science Foundation to study ‘Clustering and Search Techniques in Large Scale Networks.’