combinatorial optimization,
mathematical models and algorithms,
allocation,
k-TSP,
supply chain management,
preemptive single machine scheduling and tool switching.
UDC:
62-505.7, 65.012.122
Subject:
Combinatorial Optimization applied to allocation, k-TSP, assortment, supply chain management, single machine sequencing, scheduling including tool switching problems
Biography
Prof. Dr. Boris Goldengorin is the inventor and author of data correcting and tolerance based algorithms applied to many problems in Operations Management, Supply Chain Management, Quantitative Logistics, Industrial Engineering and Stock Market Analysis. He is an author of more than 100 papers published in top international journals including Journal of Algebraic Combinatorics, athematical and Computer Modelling, Computers & Mathematics with Applications, Computers & Operations Research, Computational Management Science, Operations Research, Management Science, European Journal of Operational Research, The Journal of Operational Research Society and many others. Dr. Goldengorin published four monographs, two textbooks and an editor of four books. He is an Associate Editor for Journal of Global Opimization, Journal of Combinatorial Optimization, and The Open Operational Research Journal.
Dr. Goldengorin has been involved in the preparation of a $4 MM mega grant to establish an international research lab on algorithms and technologies for network analysis (http://nnov.hse.ru/en/latna/). He is affiliated with Advanced Marketing Models Company (http://ammodelsinc.com/) in New York (USA).
Prof. Goldengorin taught worldwide from middle school programs up to PhD levels and supervised more than 100 BSc, MSc, and PhD students in the Netherlands, Germany, United Kingdom, Kazakhstan, Russia, Ukraine, and United States.
Main publications:
B. Goldengorin, G. Sierksma, G. A. Tijssen, M. Tso., “Correcting Algorithm for Minimization of Supermodular Functions.”, Management Science, 45:11 (1999), 1539-1551
B. Goldengorin, D. Ghosh, G. Sierksma., “Branch and peg algorithms for the simple plant location problem”, Computers & Operations Research, 30:7 (2003), 967–981
B. Goldengorin, Gert A.Tijssen, D. Ghosh, G. Sierksma., “Solving the simple plant location problem using a data
correcting approach.”, J. Global Optim. 25 (2003), no. 4, 377–406., Journal of Global Optimization, 25:4 (2003), 377–406
B. Goldengorin., “Maximization of submodular functions: theory and enumeration algorithms.”, European Journal of Operational Research, 198:1 (2009), 102-112
B.Goldengorin, D.Krushinsky, J. Slomp., “Flexible PMP approach for large size cell formation.”, Operations Research, 60:5 (2012), 1157-1166
B. I. Gol'dengorin, “On the exact solution of problems of unification by correcting
algorithms”, Dokl. Akad. Nauk SSSR, 294:4 (1987), 803–807
1986
2.
B. I. Gol'dengorin, “Decomposition of the allocation problem”, Avtomat. i Telemekh., 1986, no. 5, 91–101; Autom. Remote Control, 47:5 (1986), 668–677
3.
B. I. Gol'dengorin, “A decomposition algorithm for the unification problem and new
polynomially solvable cases”, Dokl. Akad. Nauk SSSR, 288:1 (1986), 19–23
B. I. Gol'dengorin, “A correcting algorithm for solution of siting problems”, Avtomat. i Telemekh., 1984, no. 5, 53–62; Autom. Remote Control, 45:5 (1984), 590–598
1983
5.
B. I. Gol'dengorin, “A correcting algorithm for solving some discrete optimization problems”, Dokl. Akad. Nauk SSSR, 270:3 (1983), 525–528
1977
6.
B. I. Gol'dengorin, “Methods of solving multidimensional unification problems”, Upravliaemie systemy, 1977, no. 16, 63–72
Contact us: