Education programs | MIPT - Moscow Institute of Physics and Technology

Research supervisor

Professor Boris Goldengorin

Doctor of Science,
Russian Academy of Sciences,
Moscow, Russia

Program description in Russian

Possible research titles

Data Correcting and Tolerance Based Algorithms

Supervisor’s research

Data Correcting and Tolerance Based Algorithms representing a unified approach to modeling and solving problems in Applied Combinatorial Optimization, e.g. Preemptive Single Machine Scheduling, Maximization (Minimization) of Submodular (Supermodular) Functions, Pseudo-Boolean Polynomials in Multidimensional Big Data Aggregation, Max-Clique, Max-Cut (including Quadratic Cost Partition), Capacitated Vehicle Routing in Cloud Computations applied to Virtual and Physical Resources, Facility Locations, Cell Formation in Industrial Engineering some of which might be found on amazon.com click

Supervisor’s specific requirements

Advanced courses in Mathematical Programming, Discrete (Combinatorial) Optimization, Algorithms and Data Structures, Mathematical Statistics and Standard Software

Ability to design and implement algorithms including the proof of their correctness based on advanced data structures.

At least 3 years experience in C++, MatLab, CPLEX or similar software

Shortlisted candidate will be invited for a 30-min skype interview and one week for implementation an algorithm with reported computational study

Research highlight

The aim of this program is to establish world wide competitive Mathematical Models, Algorithms, and Software with the purpose to solve computationally intractable benchmark instances

Main publications

Ehsan Ahmadi, Boris Goldengorin, Gursel Suer, Hadi Mosadegh. A hybrid method of 2-TSP and novel learning-based GA for job sequencing and tool switching problem. Applied Soft Computing, 2018, 65:214 -- 229.
Daniel Karapetyan, Boris Goldengorin. Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Körkel-Ghosh instances. In Honor of the 60th Birthday of Gregory Gutin: Optimization Problems in Graph Theory. Springer Optimization and Its Applications, 139, 2018, 123 -- 146.
B. Goldengorin (Ed.). Optimization Problems in Graph Theory. In Honor of Gregory Z. Gutin\textquotesingle s 60th Birthday. Springer Optimization and Its Applications, 139, 2018, 341 pp.\\ https://www.springer.com/la/book/9783319948294
Y. Qiu, L. Wang, X. Fang, P. M. Pardalos & B. Goldengorin. Formulations and Branch-and-Cut Algorithms for Production Routing Problems with Time Windows. Transportmetrica A: Transport Science, 2018 14(8), 669–690.
Boris Goldengorin, Vadim Romanuke. Online heuristic for the preemptive single machine scheduling problem to minimize the total weighted tardiness. Computers & Industrial Engineering, 155, 2021, 107090. https://doi.org/10.1016/j.cie.2020.107090
Boris Goldengorin, Vadim Romanuke. Experimental analysis of tardiness in preemptive single machine scheduling. Expert Systems with Applications, 186, 2021, 114947. https://doi.org/10.1016/j.eswa.2021.114947
Artem Fomin, Boris Goldengorin. An exact algorithm for the preemptive single machine scheduling of equal-length jobs. Computers & Operations Research Volume 142, 2022, 105742. https://doi.org/10.1016/j.cor.2022.105742
Mikhail Cherniavskii, Boris Goldengorin. An Imroved KTNS Algorithm for the Job Sequencing and Tool Switching Problem. The 51st Annual Meeting of the Southeast Decision Sciences Institute, February 16 -18, 2022. Book of Proceedings online (Ping Wang, Editor), Jacksonville, FL, 2022, 612-628. https://www.sedsi.org/_files/ugd/f590f6_475fc3da9f904956a4e1b289745b6f4a.pdf
Tendai Mapungwana Chikake and Boris Goldengorin. Dimensionality reduction using pseudo-Boolean polynomials for cluster analysis. Data Analysis and Optimization. In Honor of Boris Mirkin’s 80th Birthday. Springer Optimization and Its Applications, 202, 59—72, 2023