Boris Goldengorin

AboutA brief description of scholarly activities 1. My academic qualifications show my personal motivation to study and teach by means of defended 2 MSc dissertations (in Computer Science and Applied Mathematics), PhD in Standardization and Production Quality Control, PhD in Combinatorial Optimization, and ScD in Applied Mathematics (Operations Research). 2. My teaching experience includes design and implementation syllabi, schedules of lectures, tutorials, and labs implemented online and offline in multi-cultural universities located in Europe (United Kingdom, Germany, The Netherlands, just to mention a few) and United States (Ohio University, Athens, OH and University of Baltimore, Baltimore, MD). I have coined, designed, and implemented the course Quantitative Logistics in 1995. 3. In 1998 I have discovered a new way of understanding and teaching applications of the Linear Assignment Problem applied to many scheduling and decision science problems including a wide class of Single Machine Scheduling problems in Supply Chain Management and Input- Output in Economics. 4. In 2008 I have introduced the notion of optimal modeling within a class of Mixed Boolean . Linear Programming (MBLP) models by means of its minimal size in terms of the decision variables number and constraints. This notion is illustrated for the p-median problem (PMP) by Theorem 2.5. The numbers of coefficients in the objective, variables, and constraints in MBLP are minimal within the class of mixed Boolean LP models for PMP. See [1] in the Books. 5. I have more than 15 years of industrial experience in supply chain management of technologies and logistics in mechanical engineering, pharmacy products, and logistics of express post parcels. 6. I have supervised more than 100 MSc, 7 PhD and 1 Sc.D (habilitation) students. 7. I have won more than 20 research grants as PI or Co-PI including a 4 MM mega grant for organization and leadership of the research laboratory on Algorithms and Technologies for Networks Analysis (see my 10 presentations on lab’s seminars https://nnov.hse.ru/en/latna/seminar/main). 8. For more than 30 years I’m a production and service consultant for many private and governmental companies and organizations. 9. I served as a manager and organizer of 15 international conferences and workshops in the recent 20 years. Also, I participated as a program committee member, manuscripts reviewer, and proceedings editor, see all recent meetings in global optimization https://wcgo2019.event.univ- lorraine.fr/page/ipc and operations research http://www.icores.org/ProgramCommittee.aspx, and DATA ANALYTICS 2021-23, https://www.iaria.org/conferences2021/ComDATAANALYTICS21.html, https://www.iaria.org/conferences2022/ComDATAANALYTICS22.html, https://www.iaria.org/conferences2023/ComDATAANALYTICS23.html, including the International conference "Data Analysis, Optimization and their Applications" on the occasion of Boris Mirkin's 80th birthday, January 30-31, 2023 https://mipt.ru/education/chairs/dm/conferences/data-analysis- optimization-and-their-applications-2023.php . 10. In the recent 25 years I delivered over 100 presentations during international conferences, workshops, and seminars including 44 invited tutorials and plenary lectures. 11. I wrote papers and conducted computational experiments keeping my students and colleagues as world champions for decades. The most long standing is the Quadratic Cost Partition Problem (QCP) benchmark instances solved by my Data Correcting Algorithm (DCA), see Soviet Math. Doklady, 1983 and Management Science, 1999, with 17.1 sec compared to the world leading expert group in Discrete Optimization, supervised by Dr. Nemhauser, EJOR, 1996, in 864.27 sec, for 80 vertices and 20% density, 80/0.2 where the DCA solved 80/1 just in 0.22 sec. A conclusion for many years of computational competition related to QCP and its special case of Max-Cut Problem is summarized in our Data Correcting Algorithms book, see Goldengorin, Pardalos, 2013, as follows. Recently Billionne and Elloumi, Math. Progr. 2007 and Rendl et al. Math. Progr. 2010 have reported the so called “progress” with solving Max- Cut problem instances on dense graphs with up to 100 and 250 vertices, respectively. This is negligible “achievement” compared to the Data Correcting (DCA) (Preliminary Preservation Algorithm-PPA) ability to solve similar problems with up to 500 vertices. It seems that the authors of both papers are overlooked the computational results produced by the data correcting approach to the Quadratic Cost Partition and Max-Cut Problems published in Goldengorin et al. Man. Sci., 1999 and Goldengorin and Ghosh, Journal of Global Optimization, 2006. I am not aware whether somebody up to January, 2025 is able to solve to optimality the above mentioned completely dense (100%) benchmark instances with 500 vertices. One more example is our optimal solution found in 5,327 seconds and published May 24th, 2006 for the Traveling Salesman Problem benchmark instance kept the world record for more than 10 years and on April 16th, 2017 its optimality is confirmed by Concorde team and software based on the CPLEX as a Linear Programming relaxation solver in 2.2 days or 190,080 seconds (see, http://www.math.uwaterloo.ca/tsp/vlsi/xsc6880.log.html). Similar records for The Cell Formation Problem, Goldengorin et al. Operations Research, 2012, the Simple Plant Location Problem, see Karapetyan, Goldengorin, 2018 for the Preemptive Single Machine Scheduling Problem, Fomin, Goldengorin, 2002, and the Tool Replacement Problem, 2025, https://doi.org/10.1287/ijoc.2023.0474. The most recent one – solved all small and middle size Simple Plant Location benchmark instances of Beasley’s OR Library in 194 ms on a standard PC compared to the Adaptive Binary Parallel Evolutionary Algorithm, which required 30, 360 ms (Sonuc and Ozcan 2023), and the MBGOA heuristic, which required 8, 870 ms (Babalik and Babadag 2025), the corresponding paper is submitted in November 2025 to INFORMS Journal on Computing. 12. I have published 85 papers in peer reviewed journals including Journal of Algebraic Combinatorics, Journal of Combinatorial Optimization, Computers & Operations Research, Journal of Global Optimization, Discrete Optimization, Lecture Notes in Computer Science, Journal of Computer Science, European Journal of Operational Research, Handbook of Combinatorial Optimization, Theory of Optimization, Journal of Heuristics, Mathematical and Computer Modeling, Journal of Operational Research Society, Algorithmic Operational Research, Computers & Mathematics with Applications, Expert Systems with Applications, Computers & Industrial Engineering, Computer Optics, Operations Research, and Management Science, 26 chapters in peer reviewed books, 3 textbooks, 5 peer reviewed monographs, 35 peer reviewed conference publications, 23 technical reports, and edited 7 books in the following areas: combinatorial optimization and its applications; models, algorithms and technologies for network analysis; clusters, orders, and trees; control sciences and data analysis. My publications https://scholar.google.com/citations?user=rGtDNa4AAAAJ&hl=en and books are here https://www.amazon.com/Boris-Goldengorin/e/B00AR073TE. 13. For the recent 30 years I have been an associate editor of 6 peer reviewed journals, and currently I am an associate editor of the following peer reviewed journals: Journal of Combinatorial Optimization, https://www.springer.com/mathematics/journal/10878/PSE?detailsPage=editorialBoard Journal of Global Optimization, https://www.springer.com/mathematics/journal/10898/PSE?detailsPage=editorialBoard SN Operations Research Forum, https://www.springer.com/journal/43069/editors and senior editor for Journal of Computational and Applied Mathematics http://opmj.univ.kiev.ua/editorial%20staff_e.htm and Journal of Automation and Information Sciences https://www.begellhouse.com/journals/automation-and- information-sciences/editorial.html (both Ukraine). 14. I am a reviewer for 17 peer reviewed journals including Mathematical and Computer Modeling, Annals of Operations Research, European Journal of Operational Research, Computers and Operations Research, IIE Transactions, Discrete Applied Mathematics, Discrete Optimization, Journal of Computer Science, The Open Operational Research Journal, Information and Software Technology, IEEE Transactions on Systems, Management, and Cybernetics, Journal of Classification, Applied Mathematical Modelling, Journal of Global Optimization, Journal of Combinatorial Optimization, Operations Research Perspectives, Expert Systems with Applications, Computers & Industrial Engineering with an average of 32 papers and one book per year. 15. I am a certified professor in engineering cybernetics. 16. I am interested to teach the following courses and seminars. For undergraduate students: Introduction to Operations Research; Applied Linear Programming; Algorithms and Data Structures; Scheduling Theory and Its Applications; Science and Art of Independent Research Projects. For graduate students: Mathematics of AI and Cybersecurity, Operations Research 1 and 2; Integer (Discrete) Optimization; Quantitative Logistics; Submodular Functions in Machine Learning; Data Aggregation; Applied Combinatorial Optimization; Advanced Quantitative Logistics; Independent Research Projects; Research Seminar for BSc, MSc and PhD students: Job Sequencing and Tool Switching Problem and Its Variations.

Dr. Boris Goldengorin is the author of data correcting and tolerance based algorithms applied to many problems in operations research, supply chain management, quantitative logistics, industrial engineering, and stock market analysis. Boris is the author of more than 100 articles published in leading international journals, including the Journal of Algebraic Combinatorics, Discrete Optimization, Journal of Combinatorial Optimization, Journal of Global Optimization, Operations Research, Management Science, European Journal of Operational Research, Journal of Operational Research Society, Mathematical and Computer Modelling, Computers & Operations Research, Computers & Industrial Engineering, Expert Systems with Applications, Journal of Heuristics, Optimization Methods & Software, Computational Management Science, and many others. Dr. Goldengorin has published four monographs, three textbooks and an editor of six books on cell formation in industrial engineering, quantitative logistics, combinatorial optimization, network analysis algorithms, graph theory, and big data analysis. He is an associate editor of Journal of Global Optimization, Journal of Combinatorial Optimization, SN Operations Research Forum and member of the Editorial Board of the Journal of Computational and Applied Mathematics of the National University. T. G. Shevchenko, Journal of Automation and Information Sciences, both Ukraine. https://www.amazon.com/Boris-Goldengorin/e/B00AR073TE

EducationEDUCATION 2002, Ph.D., Combinatorial Optimization, University of Groningen, Groningen, The Netherlands; 1990, Sc.D., Operations Research, Institute of System Analysis, USSR Academy of Sciences, Moscow, USSR; 1975, Ph.D., Standardization and Quality Management, VNIINMASH of the USSR Ministry of Standardization, Moscow, USSR; 1973, M.Sc., Operations Research (Applied Mathematics), University of Electronics and Mathematics, Moscow, USSR; 1967, M. Sc., Electrical Engineering (Computer Science), Ryazan Radio Engineering University, Russia, USSR.

PublicationsBoris Goldengorin. Publications, updated 04.04.2025 Peer Reviewed Journal Publications (Q2=20 publications, Q1=29 publications are colored) 1. B. I. Goldengorin. Standardization of vacuum diffusion welding sets. Express-Standard, 28, 1974, 3--5, (in Russian). 2. B. I. Goldengorin. The design of optimal assortment for the vacuum diffusion welding sets. Standards and Quality, 2, 1975, 19--21, (in Russian). 3. B. I. Goldengorin, D. E. Guralnik, L. Kh. Luchansky, I. M. Farfel. Roller supports and sections of roller welding sets.Types, basic parameters and sizes. The USSR National Standard GOST 21 327--75. Moscow, Standards Publisher, 1975, 5 pp. (in Russian.) 4. B. I. Goldengorin, D. E. Guralnik, L. Kh. Luchansky, I. M. Farfel. Drives of roller welding sets. Types and basic parameters. The USSR National Standard GOST 21 328-75. Moscow, Standards Publisher, 1976, 2 pp. (in Russian.) 5. B. I. Goldengorin, R. S. Ayupova. Models and algorithms of assortments problems in mechanical engineering. Standard: Express information, 1976, 27, 3--4, (in Russian.) 6. B. I. Goldengorin. Methods of solving multidimensional unification problems. Upravljaemye Sistemy, Institute of Mathematics, Siberian Branch of USSR Academy of Sciences, Novosibirsk, No. 16 (1977), 63--72. MR0680955 (58 \#32952) (Reviewer: M. Manas) 90C25, (in Russian). ( cited by 9) 7. B. I. Goldengorin. Optimization of the action period for assortment problems. Standards and Quality, 1977, No.2, 18--20, (in Russian). 8. B. I. Goldengorin. The sensitivity analysis of optimal assortment solutions to input of data errors. Standards and Quality,1978, No.8, 55--58, (in Russian). 9. B. I. Goldengorin. An approximate method of solving the optimal unification problem. Soviet J. Comput. Systems Sci., 1979, 1, 186--189, (in Russian). 10. B. I. Goldengorin, O. A. Nabokova, A. V. Naivelt A.V. Matrix recognition algorithms for the optimal assortment problem. Standards and Quality, 1979, No.8, 17--18, 24, (in Russian). 11. B. I. Goldengorin, Yu. N. Tyurin, D. S. Shmerling. Statistical and discrete analysis of non-numerical information, expertestimations and discrete optimization. Information Materials of the USSR Academy of Sciences, Research Council on the Complex Problems in Cybernetics. VINITI, the USSR Academy of Sciences, Moscow, 1982, Vol. 4 (125), 37--49, (in Russian). 12. B. I. Goldengorin. The assortment optimization problem with costs of obtaining information. Vestnik Mosk. Universiteta, Ser. 15: Computational Mathematics and Cybernetics, 1982, 3, 20--25, (in Russian.) 13. B. I. Goldengorin. Correcting algorithm for the solution of some discrete optimization problems. Dokl. Akad. Nauk SSSR 270 (1983), no. 3, 525--528. MR0711845 (84k: 90073), 90C30 (65K10), (translated from Russian). (Cited by 21) 14. B. I. Goldengorin. A correcting algorithm for solving allocation type problems. Automat. Remote Control 45 (1984), no. 5, part 1, 590--598; translated from Avtomat. i Telemekh. 1984, , no. 5, 53--62 90C10 (90B05) (translated from Russian). 15. B. I. Goldengorin. Correcting algorithms for solving multivariate unification problems. Soviet J. Comput. Systems Sci. 23 (1985), no. 1, 99--103; translated from Izv. Akad. Nauk SSSR Tekhn. Kibernet. 1984, , no. 6, 3--7. 90B30 (68Q20), (translated from Russian). 16. B. I. Goldengorin. Unification problem decomposition in design of correcting algorithms. Information Technology Tools, ser. SS, 1985, Vol.1, 84--92, (in Russian). 17. B. I. Goldengorin, A. L. Ioffe. Polynomial time algorithms for unification problems with quasi-concave and quasi-convex-concave costs matrices. Soviet J. Comput. Systems Sci. 1985, 3, 224--227 (in Russian). 18. B. I. Goldengorin. Decomposition of the allocation problem. Avtomat. I Telemekh. 1986, no. 5, 91--101. MR0854340 (87i:90160), 90C10, (in Russian). 19. B. I. Goldengorin. The arrangement of branchings for solving unification problems by correcting algorithms. Soviet J. Comput. Systems Sci. 1986, No. 3, 167--169, (in Russian). 20. B. I. Goldengorin. A decomposition algorithm for the unification problem and new polynomially solvable cases. Dokl. Akad. Nauk SSSR 288 (1986), no. 1, 19--23. MR0841132 (87j:90128), 90C31, (translated from Russian). 21. B. I. Goldengorin. Mutual transformations of current and capital costs in the optimal allocation problem for the communication devices. Information Technology Tools, ser.SS, 1987, Vol. 3, 22--26, (in Russian). 22. B. I. Goldengorin. On the exact solution of problems of unification by correcting algorithms. Dokl. Akad. Nauk SSSR 294 (1987), no. 4, 803--807. MR0898743 (88m:90137) 90C31, (translated from Russian). 23. B. Goldengorin, G. Sierksma, G. A. Tijssen, M. Tso. The Data-Correcting Algorithm for Minimization of Supermodular Functions. MANAGEMENT SCIENCE 45(11), 1539-1551, 1999 (Cited by 69), Q1 24. Goldengorin, Boris; Ghosh, Diptesh; Sierksma, Gerard. Improving the efficiency of branch and bound algorithms for the simple plant location problem. Algorithm engineering (Arhus, 2001), 106--117, Lecture Notes in Comput. Sci., 2141, Springer, Berlin, 2001. MR1911297, 90B80 (90C59), Q2 25. Goldengorin, Boris; Ghosh, Diptesh; Sierksma, Gerard. Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. 30 (2003), no. 7, 967--981. (Reviewer: Horst W. Hamacher) MR1956843 (2004e:90058), 90B80 (90C57) (Cited by 61), 26. Goldengorin, Boris; Tijssen, Gert A.; Ghosh, Diptesh; Sierksma, Gerard. Solving the simple plant location problem using a data correcting approach. J. Global Optim. 25 (2003), no. 4, 377--406. (Reviewer: Zeng Kun Xu) MR1962793 (2003m:90054), 90B80 (90C59) (Cited by 36), Q2 27. Goldengorin, Boris; Sierksma, Gerard; Turkensteen, Marcel. Tolerance based algorithms for the ATSP. Graph-theoretic concepts in computer science, 222--234, Lecture Notes in Comput. Sci., 3353, Springer, Berlin, 2004. MR2158648, 90C35. (Cited by 25), Q2 28. B. Goldengorin, D. Ghosh, G. Sierksma. Branch and Peg Algorithms for the Simple Plant Location Problem. COMPUTERS \& OPERATIONS RESEARCH, 2004, 31(2) 241--255. MR2025344 (2004i:90069), 90B80 (90C57). ( Cited by 34) 29. H. Bekker, E.P. Braad, Goldengorin. Using bipartite and multidimensional matching to select the roots of a system of polynomial equations. Lecture Notes in Computer Science, 3483, 2005, 397--406. ( Cited by 23), Q2 30. V. Kuzmenko, B. Goldengorin, M. Tso, P. Stetsyuk. A comparison of two subgradient methods for solving allocation problems. THEORY of OPTIMIAL SOLUTIONS, 3, 2004, 108--116 (in Russian). 31. Goldengorin, Boris; Ghosh, Diptesh A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem. J. Global Optim. 32 (2005), no. 1, 65--82. (Reviewer: Hans-Ulrich Simon) MR2155564 (2006c:90115), 90C57 (90C27). (Cited by 10), Q1 32. H. Bekker, E. P. Braad, B. Goldengorin. Selecting the roots of a small system of polynomial equations by tolerance based matching. Lecture Notes in Computer Science, 3503, 2005, 610--613.( cited by 8), Q2 33. B. Goldengorin, S.I. Lyashko, Yu. Yatcenko, N. Hritonenko. The maximization of submodular functions: old and new proofs for the correctness of the dichotomy algorithm. Journal of Computational and Applied Mathematics, 2(93), 17--28, 2005. 34. Deza, Antoine; Goldengorin, Boris; Pasechnik, Dmitrii V. The isometries of the cut, metric and hypermetric cones. J. Algebraic Combin. 23 (2006), no. 2, 197--203. (Reviewer: Ivan Izmestiev) MR2223687 (2007a:52017), 52B15 (52B05 68R05) (Cited by 10), Q1 35. Turkensteen, Marcel; Ghosh, Diptesh; Goldengorin, Boris; Sierksma, Gerard Iterative patching and the asymmetric traveling salesman problem. Discrete Optim. 3 (2006), no. 1, 63--77. MR2208960 (2006i:90099), 90C35 (90C57) (Cited by 4), Q2 36. B. Goldengorin, G. Jager, P. Molitor. Some basics on tolerances. Lecture Notes in Computer Science, 4041, 2006, 194--206. (cited by 21), Q2 37. B. Goldengorin, G. Jager, P. Molitor. Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. Lecture Notes in Computer Science, 4235, 2006, 86--97. (Cited by 14), Q2 38. B. Goldengorin, G. Jager, P. Molitor. Tolerances applied in combinatorial optimization. Journal of Computer Science, 2006, 2 (9), 716--734. ( Cited by 40) 39. B. Goldengorin, A. Makarenko, N. Smilianec. Some applications and prospects of cellular automata in traffic problems. Lecture Notes in Computer Science, 4173, 2006, 532--537. ( cited by 15) 40. V.V. Bojko, B. Goldengorin, V.N. Kuzmenko. Tolerance based algorithm for solving combinatorial optimization problems. Theory of Optimal Solutions. Glushkov Institute of Cybernetics, Ukrainian National Academy of Sciences, 6, 98--104, 2006 (in Russian). 41. Gutin, Gregory; Goldengorin, Boris; Huang, Jing. Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems. Approximation and online algorithms, 214--225, Lecture Notes in Comput. Sci., 4368, Springer, Berlin, 2006. MR2387711 (2008m:90068), 90C27(68W40). ( cited by 17) 42. D. Ghosh, B. Goldengorin, G. Gutin, G. Jager. Improving the performance of greedy heuristics for TSPs using tolerances. Communications in Dependability and Quality Management, 10(1), 52--70, 2007. 43. D. Richter, B. Goldengorin, G. Jager, P. Molitor. Improving the efficiency of Helsgaun's Lin-Kernighan heuristic for the symmetric TSP. Lecture Notes in Computer Science, 2007, 4852, 99--111. (Cited by 21), Q2 44. B. Goldengorin, J. Keane, V. Kuzmenko, M. Tso. Optimal order allocation with discount pricing. Lecture Notes in Computer Science, 2007, 4508, 273--284. Q2 45. G. Gutin, B. Goldengorin, J. Huang. Worst case analysis of GREEDY, Max-Regret and other heuristics for Multidimensional Assignment and Traveling Salesman problems. Journal of Heuristics, 14(2), 169--181, 2008.) (Cited by 29), Q1 46. Goldengorin, Boris; Jager, Gerold. The computational efficiency of the Ji-Lee-Li algorithm for the assignment problem. Algorithmic Oper. Res. 3 (2008), no. 1, 79--81. MR2386294, 90B80 (90C10). 47. A. Makarenko, B. Goldengorin, D. Krushinsky. Game of "Life" with Anticipation Property. Lecture Notes in Computer Science, 5191, 77--82, 2008. (Cited by 10), Q2 48. Turkensteen, Marcel; Ghosh, Diptesh; Goldengorin, Boris; Sierksma, Gerard. Tolerance based branch and bound algorithms for the ATSP. European J. Oper. Res. 189 (2008), no. 3, 775--788. MR2400907 , 90C27 (90C57). ( Cited by 49), Q1 49. Goldengorin, Boris. Maximization of submodular functions: theory and enumeration algorithms. European J. Oper. Res. 198. (2009), no. 1, 102--112. MR2508037 , 05C85 (90C57) ( Cited by 15}). Q1 50. AlBdaiwi, Bader F.; Goldengorin, Boris; Sierksma, Gerard. Equivalent instances of the simple plant location problem. Comput. Math. Appl. 57 (2009), no. 5, 812--820. MR2498658 , 90 B 80 (90 C 09) (Cited by 17), Q1 51. V.V. Bojko, B. Goldengorin, V.N. Kuzmenko. Some bounds for the p-Median Problem. Theory of Optimal Solutions. Glushkov Institute of Cybernetics, Ukrainian National Academy of Sciences, 8, 22--27, 2009 (in Russian). 52. O.S. Makarenko, D.A. Krushinsky, B.I. Goldengorin. A Model of Cellular Automaton with Anticipation. National Engineering University of Ukraine ``Kyiv Politechnical Institute," Scientific News, 2009, 1, 30--35 (in Ukrainian). 53. Harmen W. Bouma, Boris Goldengorin. Single machine scheduling: The problem $1|pmtn; p_j=p; r_j|\sum T_jw_j$ is pseudo-polynomially solvable. Discrete Optimization (2010), doi:10.1016/j.disopt.2010.03.009, Available online 21 May 2010, https://www.sciencedirect.com/science/article/pii/S1572528610000241 54. Makarenko A., Krushinsky D., Musienko A., B. Goldengorin. Towards Cellular Automata Football Models with Mentality Accounting. Lecture Notes in Computer Science, 6350, 149--152, 2010. (Cited by 2) 55. B. F. AlBdaiwi, D. Ghosh, B. Goldengorin. Data Aggregation for p-Median Problems. Journal of Combinatorial Optimization, 2011, 3(21), 348--363; DOI: 10.1007/s10878-009-9251-8, http://www.springerlink.com/content/83770387h2652uk2/fulltext.pdf \newline within open access at Springerlink.com (cited by 24), Q2 56. B. Goldengorin, J. Keane, V. Kuzmenko, M. Tso. Optimal supplier choice with discounting. The Journal of Operational Research Society, 2011, 62(4), 690--699. (Cited by 1), Q1 57. B. Goldengorin, D. Krushinsky. Complexity evaluation of benchmark instances for the p-median problem. Computers and Mathematics with Applications, 2011, 9-10(53), 1719--1736. ({\bf cited by 23}), Q1 58. B. Goldengorin, D. Krushinsky. A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation. Lecture Notes in Computer Science, 2011, 6701, 503--516. (Cited by 15), Q2 59. Vyacheslav V. Chistyakov, Boris I. Goldengorin, Panos M. Pardalos. Global tolerances in the problems of combinatorial optimization with an additive objective function. Doklady Mathematics, Computer Science 2012, 86(2), 707--710. (Cited by 2) 60. R. Germs, B. Goldengorin, M. Turkensteen. Lower tolerance-based Branch and Bound algorithms for the ATSP Computers & Operations Research, 2012, 39(2), 291--298. MR2804069 (2012g:90167) (Reviewer: Jean Mailfert) 90C27 (90C57)(cited by 42) 61. Vyacheslav V. Chistyakov, Boris I. Goldengorin, Panos M. Pardalos. Extremal values of global tolerances in combinatorial optimization with an additive objective function. Journal of Global Optimization, 2012, 53(3), 475-495. DOI 10.1007/s10898-012-9847-x MR2929736 (Reviewer: David Jacob Wildstrom) 90C27 (90C59) (Cited by 2), Q1 62. A.N. Vizgunov, B.I. Goldengorin, V.A. Zamarayev, V.A. Kalyagin, A.P. Koldanov, P.A. Koldanov, P.M. Pardalos. Application of market graphs to a stock market analysis. The Journal of New Association in Economics, 2012, 3, 66--81 (in Russian) (Cited by 22). 63. D. Krushinsky. B. Goldengorin. An exact model for cell formation in group technology. Computational Management Science, 2012, 9, 323-338. DOI 10.1007/s10287-012-0146-2, available at http://www.springer \newline link.com/content/ug2l55m46t554564/ fulltext.pdf within open access at \newline Springerlink.com MR2998886 (Review) 90B80 (90C11) (Cited by 27), Q1 64. B. Goldengorin, D. Krushinsky, J. Slomp. Flexible PMP approach for large size cell formation. Operations Research, 2012, 60(5), 1157-1166. (Cited by 26), Q1 65. B. I. Goldengorin, P. M. Pardalos, V.V. Chistyakov. Global Tolerances in the Problems of Combinatorial Optimization with an Additive Objective Function. Doklady Mathematics. Computer Science 2012, 86(2), 707--710. (Cited by 2) 66. B. I. Goldengorin, D.S. Malyshev, P. M. Pardalos. Efficient Computation of Tolerances in the Weighted Independent Set Problem on Trees. Doklady Mathematics, Computer Science 2013, 87(3), 368--371. 67. Mikhail Batsyn, Boris Goldengorin, Evgeny Maslov, Panos M. Pardalos. Improvements to MCS algorithm for the maximum clique problem. Journal of Combinatorial Optimization, 2014, 27(2):397--416. ( Cited by 52), Q2 68. A.N. Vizgunov, B.I. Goldengorin,V.A. Kalyagin, A.P. Koldanov, P.A. Koldanov, P.M. Pardalos. Network approach for the Russian stock market. Computational Management Science, 2014, 11(1):45--55. (Cited by 54) 69. G. Jager, C. Dong, B. Goldengorin, P. Molitor, D. Richter. Backbone Based TSP Heuristics for Large Instances. Journal of Heuristics, 2014, 20(1):107--124. (Cited by 7), Q1 70. Mikhail Batsyn, Boris Goldengorin, Panos M. Pardalos and Pavel Sukhov. Online heuristic for the preemptive single machine scheduling problemof minimizing the total weighted completion time. Optimization Methods and Software, 2014, 29(5):955--963. (Cited by 8), Q1 71. Gerold Jager, Boris Goldengorin, Panos M. Pardalos. The Theory of Set Tolerances. Lecture Notes in Computer Science 2014, Vol. 8426, 362--377. (Cited by 7), Q2 72. B. I. Goldengorin, D.S. Malyshev, P. M. Pardalos, V.A. Zamarayev. A tolerance-based heuristic approach for the weighted independent set problem. Journal of Combinatorial Optimization, 2015, 29(1):433--450. (Cited by 2), Q2 73. J. Zilinskas, B. Goldengorin, P. M. Pardalos. Pareto-optimal front of cell formation problem in group technology. Journal of Global Optimization, 2015, 61(1):91-108. (Cited by 13), Q1 74. Jun Pei, Wenjuan Fan, Panos M. Pardalos, Xinbao Liu, Boris Goldengorin, Shanlin Yang. Preemptive scheduling in a two-stage supply chain to minimize the makespan. Optimization Methods and Software, 2015, 30(4):727--747. (Cited by 8), Q1 75. Jun Pei, Xinbao Liu, Wenjuan Fan, Panos M. Pardalos, Athanasios Migdalas, Boris Goldengorin, Shanlin Yang. Minimizing the makespan for a serial-batching scheduling problem with arbitrary machine breakdown and dynamic job arrival. International Journal of Advanced Manufacturing Technology, 2016, 86(9):3315--3331. (Cited by 4), Q1 76. Marcel Turkensteen, Dmitry Malyshev, Boris Goldengorin, Panos M. Pardalos. The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems. Journal of Global Optimization, 2017, 68(3):601--622. (Cited by 4), Q1 77. Ehsan Ahmadi, Boris Goldengorin, G\"{u}rsel S\"{u}er, 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. (Cited by 25), Q1 78. 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. (Cited by 8), Q1 79. Boris Goldengorin, Vadim Romanuke. Online heuristic for the preemptive single machine scheduling problem to minimize the total weighted tardiness. Computers & Industrial Engineering, 2021, 155, 107090, Q1. https://doi.org/10.1016/j.cie.2020.107090 80. Boris Goldengorin, Vadim Romanuke. Experimental Analysis of Tardiness in Preemptive Single Machine Scheduling. Expert Systems with Applications, 2021, 114947, Q1. https://doi.org/10.1016/j.eswa.2021.114947 81. A. Fomin (BSc student), B. Goldengorin. An exact algorithm for the preemptive single machine scheduling of equal-length jobs to minimize the Total Weighted Completion Time. Computers & Operations Research, Volume 142, June 2022, 105742, Q1. https://doi.org/10.1016/j.cor.2022.105742 82. Yuzhuo Qiu, Mikhail Cherniavskii, Boris Goldengorin, Panos M. Pardalos. Code and Data Repository for A Computational Study of the Tool Replacement Problem INFORMS Journal on Computing 2026-02-03, Q1. https://github.com/INFORMSJoC/2023.0474 83. Yuzhuo Qiu, Mikhail Cherniavskii, Boris Goldengorin, Panos M. Pardalos. A Computational Study of the Tool Replacement Problem. INFORMS Journal on Computing. 2025-02-25, Q1. https://doi.org/10.1287/ijoc.2023.0474 84. Chikake T. M., Goldengorin B. I., Pardalos P. M. Pseudo–Boolean polynomial method for Interpretable dimensionality reduction. Computer Optics 2025; 49(6): 1191-1201. https://computeroptics.ru/KO/PDF/KO49-6/490636.pdf Peer Reviewed Book Chapters 85. Manzon M.M., Goldengorin B.I. Electrical model of mechanical impact, Patent USSR 405119, 1972, 4 pp., (in Russian). 86. Manzon M.M., Goldengorin B.I. Optimal assortment withresource constraints. Unification and standardization of systems in mechanicaland instrument engineering. Collection of Papers. The USSR National Institute of Standardization, vol.XYII, Moscow, 1974, 127--136, (in Russian). 87. Berkovich M.M., Goldengorin B.I. Approximation algorithm for solving the optimal unification problem. In Applications of mathematical economics methods and computers in standardization and quality control of mechanical engineering products. Moscow, Standards Publisher, 1974, 22--24, (in Russian). 88. Goldengorin B.I. One problem of optimal tolerances. In Applications of mathematical economics methods and computers in standardization and quality control of mechanical engineering products. Moscow, Standards Publisher, 1974, 25--27, (in Russian). 89. Goldengorin B.I. Solving a two-parameter unification problem by dynamic programming. Unification and standardization of systems in mechanical and instrument engineering. Collection of Papers. The USSR National Institute of Standardization, vol. XYII, Moscow, 1974, 141--150, (in Russian). 90. Goldengorin B.I. Solving a class of optimal unification problems by enhanced method of successive computations. Unification and standardization of systems in mechanical and instrument engineering. Collection of Papers. The USSR National Institute of Standardization, vol.VYII, Moscow, 1974, 165--179, (in Russian). 91. Goldengorin B.I., Zaidelman I.I., Sokolov V.A. An assortment problem for rollers on pneumatic tires. In Improvements of Road Machine Usage Efficiency. Collection of Papers, Moscow Cars and Roads Institute, MADI, Vol. 75, 1974, 136--143, (in Russian). 92. Manzon, M.M.; Goldengorin, B.I. Solution of unification problems with supplementary constraints by the dynamic programming method using the Lagrange function. Proceedings of the Sixth Winter School on Mathematical Programming and Related Questions (Drogobych, 1973), pp. 176--182. Central. Ekonom.-Mat. Inst. Akad. Nauk SSSR, Moscow, 1975. MR 0456523 (56 \#14747), 90C50 (90C40), (in Russian). 93. Goldengorin B.I. On a dynamical optimal unification problem. In The Methodological Basis of Unification. Moscow, VNIIMASH of USSR Gosstandart, Vol. 24, 1975, 31-- 35, (in Russian). 94. Goldengorin B.I., Potemkin L.V., Fleis M.E. The applicability of modified Cherenin's rejection rules for the optimal assortment problem. In The Methodological Basis of Unification. Moscow, VNIIMASH of USSR Gosstandart, Vol. 24, 1975, 46--54, (in Russian). 95. Goldengorin, B. I. Decomposition of a certain class of concave programming problems. Mathematical programming and related questions (Proc. Seventh Winter School, Drogobych, 1974), Numerical methods, pp. 176--186. Central. Ekonom.-Mat. Inst. Akad. Nauk SSSR, Moscow, 1976. MR0680954 (58 \#32951), 90C25, (in Russian). 96. Goldengorin B.I. Stability of solutions to a class of unification problems. In Unification of tools in instrument engineering. Moscow, VNIINMASH, The USSR National Ministry of Standards, Vol. 27, 50--57, (in Russian). 97. Goldengorin, B.I. Some remarks on properties and algorithms for solving problems of the unification, distribution type. The theory of nonregular curves in various geometric spaces, Kazakh. State Univ., Alma-Ata, 1979, 15--23, MR 0570617 (81 k :65072), 65K05, (in Russian). 98. Goldengorin B.I. Approximation of some NP-complete problems. In Management Theory and Information Processing. Kazakh State University Press, Alma-Ata, 1982, 55--68 (in Russian.) 99. Goldengorin B.I. A basic mathematical model of parameter sequence optimization with costs of information obtaining taken into account. In Management Theory and Information Processing. Kazakh State University Press, Alma-Ata, 1982, 68--73, (in Russian). 100. Goldengorin, B.I. Stability of solutions in problems with one component of connection of local minima. Models and methods for solving problems of the interaction of economic systems, 149--160, Mat. Anal. Ekonom. Modele\u\i, "Nauka" Sibirsk. Otdel., Novosibirsk, 1982. (Reviewer: A. Gopfert) MR0703159 (84i:90099), 90C10 (90B30 90C31), (in Russian). 101. Goldengorin B.I. On a way to broaden the classes of efficiently solvable unification type problems. Problems of Automatic Control System Creation for Technological Processes and Enterprises. Kazakh Polytechnical University Press, Alma-Ata, 1985, 40--44, (in Russian). 102. Goldengorin B.I., Konstantinovsky M.M. An optimization algorithm for sets of test programs with monotone matrices. In Optimization Problems for Information Collection, Processing and Transfer in Civil Aviation, Moscow Institute of Civil Aviation, Moscow, 1985, 21--25, (in Russian). 103. Goldengorin B. I., Ioffe A.L. A correcting algorithm for solving the unification problem with quasiconvex-concave costs matrix. In Management of Complex Engineering and Organizational Systems. Kazakh Polytechn. University Press, Alma-Ata, 1986, 119--124, (in Russian). 104. Goldengorin B. I. A correcting algorithm for solving the unification and allocation type problems. In Technological Means for Modeling the Problems of Power Engineering. Kiev, Naukova Dumka, 1986, 170--174, (in Russian). 105. Goldengorin, B. I. Efficiently solvable classes for a one-product allocation problem. Models and methods for the optimization of economic systems, 137--152, "Nauka" Sibirsk. Otdel., Novosibirsk, 1987. MR0908734 (89c:90058), 90B30 (90B99 90C08), (in Russian). 106. Goldengorin B. I. An algorithm with a priori time complexity estimation for solving unification problems. In Analysis and Modelling of Economic Processes: Inter-University Transactions. Gorky State University Press, Gorky 1987, 37--41, (in Russian). 107. Goldengorin B. I. Recognition and approximation algorithms for irregular costs matrices by regular costs matrices in unification problems. In Modelling and Optimization of Complex Structure Systems. Inter-University Transactions, Omsk State University Press, Omsk, 1987, 44--51, (in Russian.) 108. D. Ghosh, B. Goldengorin, G. Sierksma. Data Correcting: A Methodology for Obtaining Near-Optimal Solutions. Operations Research with Economic and Industrial Applications: Emerging Trends. S.R. Mohan and S.K. Neogy (Eds.), Anamaya Publishers, New Delhi, India, 2005, pp. 119--127. 109. Ghosh, Diptesh; Goldengorin, Boris; Sierksma, Gerard. Data correcting algorithm ms in combinatorial optimization. Handbook of combinatorial optimization. Supplement Vol. B, 1--53, Springer, New York, 2005. MR2114589, 90C27 (90C35). 110. M. Turkensteen, D. Ghosh, B. Goldengorin, G. Sierksma. Tolerance based branch and bound algorithms. A EURO Conference for young OR researches and practioners, ORP3 2005, 6--10 September, Valencia, Spain. Proceedings Edited by C. Maroto et al., ESMAP, S.L. 2005, 171--182. 111. Ghosh, Diptesh; Goldengorin, Boris; Gutin, Gregory; Jager, Gerold Tolerance-based algorithms for the traveling salesman problem. Mathematical programming and game theory for decision making, 47--59, Stat. Sci. Interdiscip. Res., World Sci. Publ., Hackensack, NJ, 2008. MR2459152 , 90C27 (90B80). 112. B. Goldengorin, V. Kuz'menko. Data Compression for p-Median Problems. Collection of papers. Faculty of Applied Mathematics and Computer Technologies, Khmelnitsky National University, 2008, 1, 99--106. 113. D. Karapetyan, G. Gutin and B. Goldengorin. Empirical evaluation of construction heuristics for the multidimensional assignment problem. London Algorithmics 2008: Theory and Practice, College Publications, 2009, 107--122. (cited by 7) 114. B. Goldengorin, D. Krushinsky, A. Makarenko. Synchronization of Movement for a Large-Scale Crowd. Chapter 6 in: Recent Advances in Nonlinear Dynamics and Synchronization: Theory and Applications. K. Kyamakya et al. (Eds.), Springer, 2009, 277--306. https://www.springer.com/gp/book/9783642042263 115. Bouma, H.W., Goldengorin, B.: A polytime algorithm based on a primal LP model for the scheduling problem 1|pmtn;p j=2;r j|∑w j C j. Proceedings of the 2010 American Conference on Applied Mathematics, AMERICAN-MATH’10, Stevens Point, Wisconsin, USA, pp. 415–420. World Scientific and Engineering Academy and Society (WSEAS) (2010) 116. B. Goldengorin. Data Correcting Approach for Routing and Location in Networks. Handbook of combinatorial optimization. Pardalos, Panos M.; Du, Ding-Zhu; Graham, Ronald L. (Eds.), 2nd Edition, Springer, New York, 2013, 929-993; cited as the Popular Content within this publication https://www.springer.com/gp/book/9781441979964 117. B. I. Goldengorin, A. A. Kocheturov. Analysis of finacial markets by means of $p$-median model. Mathematical methods in natural, engineering and social sciences. Collection of Papers. Nizhny Novgorod Technical State University named by R. E. Alekseev, Nizhny Novgorod, Russia, 2014, Vol. 102(5), 367 -- 374 (in Russian). 118. B. Goldengorin, D. Krushinsky. Linear Assignment Problems in Combinatorial Optimization. In Honor of the 80th Birthday of Ivan V. Sergienko: Optimization Methods and Applications. Springer Optimization and Its Applications, 130, 2017, 183 -- 216. 119. 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. 120. B. Goldengorin. Data Correcting Approach for Routing and Location in Networks. Handbook of combinatorial optimization. Pardalos, Panos M.; Du, Ding-Zhu; Thai, My T. (Eds.), 3d Edition, Springer, New York, 2024, First Online: 28 September 2024. https://link.springer.com/referenceworkentry/10.1007/978-1-4614-6624-6_84-1 121. Artem Fomin, Boris Goldengorin. Preemptive Single Machine Scheduling: Theory and Algorithms. Handbook of Combinatorial Optimization (3rd edition). Panos Pardalos, Ding-Zhu Du and My T. Thai. (Eds.) 38 pp. Springer Science + Business Media, New York, 2025. https://link.springer.com/rwe/10.1007/978-1-4614-6624-6_109-1#Ack1 122. T. M. Chikake, B. Goldengorin, P. M. Pardalos. Applications of Pseudo-Boolean polynomials in medical imaging. Trends in Biomathematics: Modeling Health Across Ecology, Social Interactions, and Cells / ed. by R. P. Mondaini. Cham : Springer Nature Switzerland, 2025. Peer Reviewed Books 123. Goldengorin B.I., Efimov A.P. Assembler for IBM 360/370. Textbook. Kazakh University Press, Alma-Ata, 1979, 120 pp. (in Russian). 124. Goldengorin B. I. Introduction to Assemblers for Modern Computers. Textbook, Kazakh Polytechn. University Press, 1992, 120 pp. (in Russian). 125. Goldengorin B. I. Optimization models and algorithms for the requirements of standards. Science Publisher, Alma-Ata, 1992, 240 pp. (in Russian). 126. B. Goldengorin. Requirements of Standards: Optimization Models and Algorithms, Russian Operations Research Co., Hoogezand, The Netherlands, 1995, 219 pp. The Book Review by C. Leake (University of Maryland) is published in Journal of the Operational Research Society (1997) 48, 103--104. (Cited by 34) 127. B. Goldengorin. 20 Lectures in Combinatorial Optimization. Lecture Notes. Department of Operations, University of Groningen, Groningen, The Netherlands, 2009, 224 pp. 128. B. Goldengorin. Data Correcting Algorithms in Combinatorial Optimization. Ph.D. Thesis, Research Institute of Systems, Organizations and Management, University of Groningen, Groningen, The Netherlands, 2002, 208 pp. 129. B. Goldengorin, P.M. Pardalos. Data Correcting Approaches in Combinatorial Optimization. Springer, New York, 2012, 116 pp. MR2978563 \newline http://www.springer.com/book/978-1-4614-5285-0 MR2978563 (Reviewer: Hans-Ulrich Simon) 90-02 (90C27) (cited 10) 130. B. Goldengorin, V.A. Kalyagin, P.M. Pardalos (Eds.) Models, Algorithms, and Technologies for Network Analysis. Proceedings of the First International Conference on Network Analysis. Springer Proceedings in Mathematics & Statistics, 32, 2013, 236 pp. https://www.springer.com/gp/book/9781461485872 131. B. Goldengorin, D. Krushinsky, P. M. Pardalos. Cell Formation in Industrial Engineering: Theory, Algorithms and Experiments. Springer, New-York, 2013, 218 pp. ISBN: ISBN 978-1-4614-8001-3 (Cited by 26). https://www.springer.com/gp/book/9781461480013 132. B. Goldengorin, V.A. Kalyagin, P.M. Pardalos (Eds.) Models, Algorithms, and Technologies for Network Analysis. Proceedings of the Second International Conference on Network Analysis. Springer Proceedings in Mathematics & Statistics, 59, 2013, 204 pp. http://www.springer.com/mathematics/book/978-1-4614-8587-2 133. F. Aleskerov, B. Goldengorin, P. M. Pardalos (Eds.) Clusters, Orders, and Trees: Methods and Applications. In Honor of Boris Mirkin’ s 70th Birthday. Springer Optimization and Its Applications, 92, 2014, 386 pp. https://www.springer.com/gp/book/9781493907410 134. B. Goldengorin (Ed.). Optimization and Its Applications in Control Sciences and Data Analysis. In Honor of Boris T. Polyak’s 80th Birthday. Springer Optimization and Its Applications, 115, 2016, 507 pp. https://www.springer.com/us/book/9783319420547 135. 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 136. B. Goldengorin and S. Kuznetsov (Eds.). Data Analysis and Optimization. In Honor of Boris Mirkin’s 80th Birthday. Springer Optimization and Its Applications, 202, 2023, 404 pp. (publication 17 Sep 2023) https://link.springer.com/book/9783031316531 137. B. Goldengorin (Ed.). Theory, Algorithms and Experiments in Applied Optimization: In Honor of the 70th Birthday of Panos M. Pardalos. Springer Optimization and Its Applications, 226, 2025, 504 pp. (publication July, September 2025) https://link.springer.com/book/9783031913563 Peer Reviewed Conference Publications 138. B. Goldengorin (Ed.) Optimization Problems in Graph Theory. In Honor of Gregory Z. Gutin’s 60th Birthday. Springer Optimization and Its Applications, 305 pp. 139. Goldengorin B.I. Combinatorial method for solving the assortment problem. Abstracts. The USSR Conference on State of-Art and Further Developments in Standardization and Unification, Erevan, 1--3 December, 1975, 151--152, (in Russian). 140. Goldengorin B.I. Stability of solutions to a class of discrete programming problems. In Mathematical OptimizationMethods and their Applications in Large Economical and Engineering Systems. Abstracts of the USSR School-Seminar, Baku, 22 Sept..2 Oct.1980, Moscow, TsEMI AN SSSR, 1980, 89-90, (in Russian). 141. Goldengorin B.I. The adequacy of decision making models described by discrete extremal problems with respect to input data errors. In Inter-University Conference on the Application of Computers and Mathematical Methods in Scientific Research.Abstracts. Alma-Ata, Kazakh University Press, 1980, p. 56, (in Russian). 142. Goldengorin B.I. Stability of solutions to unification problems with a single component of local minima. TheFirst USSR Conference on Statistical and Discrete Analysis of Non-Numerical Information. Section Discrete Optimization. Abstracts. Moscow, VINITI AN SSSR 1981, 265--266, (in Russian). 143. Goldengorin B.I. A unification model with the costs of information obtaining and refinement. The First USSR Conference on Statistical and Discrete Analysis of Non-Numerical Information. Section Discrete Optimization. Abstracts. Moscow, VINITI AN SSSR 1981, 270--271, (in Russian). 144. Goldengorin B.I. Approximation of a submodular function by an A-function in unification and allocation problems. The First USSR Conference on Statistical and Discrete Analysis of Non-Numerical Information. Section Discrete Optimization. Abstracts. Moscow, VINITI AN SSSR 1981, 290--291, (in Russian). 145. Goldengorin B.I., Ioffe A.L. Approximation of an irregular cost matrix by a quasi-convex one. The First USSR Conference on Statistical and Discrete Analysis of Non-Numerical Information. Section Discrete Optimization. Abstracts. Moscow, VINITI AN SSSR 1981, 282--283, (in Russian). 146. Goldengorin B.I., Tokar S.I. Noise immunity of the preliminary rejection algorithm. The First USSR Conference on Statistical and Discrete Analysis of Non-Numerical Information. Section Discrete Optimization. Abstracts. Moscow, VINITI AN SSSR 1981, 264 p., (in Russian). 147. Goldengorin B.I. Applications of correcting algorithm for solving the covering and extremal disjunctive normal form problems. Abstracts of the First Kazakhstan National Conference on computerization of scientific research. Mathematics and Mechanics Institute of AN Kaz. SSR, Alma-Ata, 1982, (in Russian). 148. Goldengorin B.I. Approximation algorithm for synthesizing optimal structures of complex systems. In Methods and Programs of Solving Optimization Problems on Networks and Graphs. Part 2. Theory and Algorithms. Abstracts of the Second USSR Workshop, Ulan-Ude, 22--26 August 1982. Novosibirsk, Computer Center, SO AN SSSR, 1982, 32--33, (in Russian.) 149. Goldengorin B.I. The method of order topologies in sensitivity and stability studies of discrete extremal problems. In Abstracts of the 4th USSR Workshop on Invariance, Theory of Sensitivity and their Applications. IPU AN SSSR, Moscow, 1982, 96--97, (in Russian). 150. Goldengorin B.I. Generation of benchmarks for experimental studies of integer programming algorithms. In Abstracts of the 9th USSR Workshop on Control Problems, IPU AN SSSR, Moscow 1983, p.308, (in Russian). 151. Goldengorin B.I. On a model of expert commission formation. In the 2nd USSR Conference on Non-Numerical Statistics, Expert Estimations, and Related Topics. VINITI AN SSSR, Moscow 1984, 355--356, (in Russian). 152. Goldengorin B.I. Computational complexity of analyzing the structure of connections between objects. In the 2nd USSR Conference on Non-Numerical Statistics, Expert Estimations, and Related Topics. VINITI AN SSSR, Moscow 1984, 136--137, (in Russian). 153. Goldengorin B.I. Interval error degeneracy in the optimal sequence choosing problem. In Methods and Programs of Solving Optimization Problems on Networks and Graphs. Abstracts of the Third USSR Workshop, Tashkent, 28.23 August 1984. Novosibirsk, Computer Center, SO AN SSSR, 1982, p. 45, (in Russian). 154. Goldengorin B.I. The space complexity of correcting algorithms. Abstracts of the 8th Kazakhstan Conf. on Mathematics and Mechanics. Part 2. Computational and Applied Mathematics. Kazakh University Press, Alma-Ata 1984, p. 103, (in Russian). 155. Goldengorin B.I. A correcting algorithm for test program batch optimization. In Applications of Statistical Methods in Production and Management. Abstracts of the USSR Research Conf., Perm, PVVKIU, 1984, 41--42, (in Russian). 156. Goldengorin B. I. Polynomial time algorithm for solving the unification problem with a truncated quasiconvex costs matrix. In Decomposition and Coordination in Complex Systems. Abstracts of the USSR Scientific Conf., Part 1, Cheliabinck, ChPI, 1986, 63--64, (in Russian). 157. Goldengorin B. I. Mutual transformations of current and fixed costs in unification and allocation type problems. In Abstracts of 10th USSR Workshop on the Control Problems, IPU AN SSSR, Moscow, 1986, 145--146, (in Russian). 158. Goldengorin B.I. Correcting algorithms: the retrospective and prospects. In Abstracts of the Research Conf. Dedicated to the 50th Anniversary of Kazakh State University. Kazakh University Press, Alma-Ata, 1984, 45--46, (in Russian). 159. Goldengorin B. I. Elimination algorithm of irregular entries in the costs matrix of unification problem. Abstracts of Kazakhstan Conf., Institute of Mathematics and Mechanics AN Kaz. SSR, 1989, 45, (in Russian). 160. B. Goldengorin. A correcting algorithm for solving some discrete optimization problems. Abstracts of Papers. International Conference in Combinatorial Optimization, CO 1989, University of Leeds, Leeds, United Kingdom, 1989, 4 p. 161. B. Goldengorin, G. A. Tijssen, M. Tso. A Non-Greedy Algorithm for Supermodular Function Minimization with Applications. In: PROCEEDINGS of INTERNATIONAL CONFERENCE on INDUSTRIAL LOGISTICS. ICIL'99. University of Southampton, United Kingdom, 1999, 318--325. 162. B. Goldengorin, G. A. Tijssen, D. Ghosh, G. Sierksma. a Data Correcting Algorithm for the Simple Plant Location Problem. XXXIII Annual Conference of the Operational Research Society of Italy, AIRO 2002. Proceedings of the annual conference, University of L'Aquilla, Italy, 2002, p.122. 163. A. Makarenko, D. Krushinsky, B. Goldengorin. Anticipation and Delocalization in Cellular Models of Pedestrian Traffic. Proceedings of INDS'08, Editor Kyandoghere Kyamakya. First International Workshop on Nonlinear Dynamics and Synchronization 2008, INDS'08. Shaker Verlag, Aachen, 2008, pp. 61--64. 164. B. Goldengorin, D. Krushinsky, A. Makarenko, N. Smilianec. Toward the Management of Large-Scale Crowds. Third International Conference on Human Centered Processes. HCP-2008 Proceedings, Part III, Workshop on OR and Ethics, June 8-12, 2008. Delft, The Netherlands. ISBN: 978- 2-908849-22-6, Institute TELECOM/TELECOM Bretagne, France, 2008, pp. 35--46. 165. B. Goldengorin, Krushinsky D., Kuzmenko V.The problem of margin calculation and its reduction via the p-Median model. Proceedings of 9th WSEAS Int. Conf. on Applied Informatics and Communications (AIC'09), Moscow, Russia, August 20-22, 2009, pp.216--221. 166. B. Goldengorin. Plenary Lecture 1: Data Correcting and Tolerance Based Algorithms in Combinatorial Optimization. RECENT ADVANCES in APPLIED MATHEMATICS: Proceedings of the AMERICAN CONFERENCE in APPLIED MATHEMATICS (AMERICAN- \newline MATH10, Harvard University, Cambridge, USA, January 27-29, 2010. Published by WSEAS Press, p. 17. 167. H. Bouma, B. Goldengorin. A Polytime Algorithm Based on Primal LP Model for the Scheduling Problem $1| pmtn; pj=2; rj | \sum w_jC_j$. RECENT ADVANCES in APPLIED MATHEMATICS: Proceedings of the AMERICAN CONFERENCE in APPLIED MATHEMATICS (AMERICAN-MATH10, Harvard University, Cambridge, USA, January 27-29, 2010. Published by WSEAS Press, pp.415--420. 168. M. Batsyn, I. Bychkov, B. Goldengorin, P. M. Pardalos, P. Sukhov. Pattern-Based Heuristic for the Cell Formation Problem in Group Technology. Springer Proceedings in Mathematics \& Statistics, Vol. 32, 11--50, 2013. 169. D. Jallo, D. Budai, V. Boginski, B. Goldengorin, P. M. Pardalos. Network-Based Representation of Stock Market Dynamics: An Application to American and Swedish Stock Markets. Springer Proceedings in Mathematics \& Statistics, Vol. 32, 91--108, 2013. (Cited by 12) 170. D. Korenkevych, F. Skidmore, B. Goldengorin, P. M. Pardalos. How close to optimal are small world properties of human brain networks? Springer Proceedings in Mathematics \& Statistics, Vol. 32, 119--130, 2013. 171. M. Batsyn, B. Goldengorin, A. Kocheturov, P. M. Pardalos. Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem. Springer Proceedings in Mathematics & Statistics, 59, 1--10, 2013. 172. M. Batsyn, B. Goldengorin, P. Sukhov, P. M. Pardalos. Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times. Springer Proceedings in Mathematics \& Statistics, {\bf Vol. 59}, 11--30, 2013. 173. B. Goldengorin, A. Kocheturov, P. M. Pardalos. A Pseudo-Boolean Approach to the Market Graph Analysis by Means of the p-Median Model. In Honor of Boris Mirkin's 70th Birthday: Clusters, Orders, and Trees: Methods and Applications. Springer Optimization and Its Applications, 92:77--89, 2014. 174. Mikhail Cherniavski, Boris Goldengorin. AN IMPROVED 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 175. T. Chikake, B. 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, 2023, 59— 72. 176. T. Chikake, Boris Goldengorin and Alexey Samosyuk. Pseudo-Boolean polynomials approach to edge detection and image segmentation. Data Analysis and Optimization. In Honor of Boris Mirkin’s 80th Birthday. Springer Optimization and Its Applications, 202, 2023, 73—87. 177. B. Goldengorin. From Prebase in Automata Theory to Data Analysis: Boris Mirkin’s Way. Data Analysis and Optimization. In Honor of Boris Mirkin’s 80th Birthday. Springer Optimization and Its Applications, 202, 2023, 147— 156. 178. Tendai Chikake, Boris Goldengorin. Image edge detection using pseudo-Boolean polynomials. Proceedings SPIE Volume 13072, Sixteenth International Conference on Machine Vision (ICMV 2023), Yerevan, Armenia; 130720O (April 2024) https://doi.org/10.1117/12.3023452 Technical Reports 179. Goldengorin B.I. Investigation and design of mathematical models and approximation algorithms for the multi-parameter assortment problems in mechanical engineering. Abstract of Ph.D. thesis in standardization and quality control. Moscow, VNIINMASH of USSR Gosstandart, 1975, 15 pp. (in Russian). 180. Goldengorin B.I. Investigation and design of mathematical modelsand approximation algorithms for the multi-parameter assortment problems in mechanical engineering. Ph.D. thesis in standardization and quality control. Moscow, VNIINMASH of USSR Gosstandart, 1975, 139 pp. (in Russian). 181. Goldengorin B.I. Development of algorithms and programs of automation of examination. Research Report to the USSR Center of Scientific Information. The Government Registration Number 78053289, Moscow 1978, 56 pp. (in Russian). 182. Goldengorin B.I. Database structure stability. Development and study of algorithms for the realization of inquiry languages for relational database control systems. Book 1: Research Report (Final). Kazakh State University, KMO.141; Government registration number 01830011814; Inventory number 02840021694. Alma-Ata, 1983, 39 pp. (in Russian). 183. Goldengorin B.I., Sakhariev B., Nimasipov H. Development of optimization methods for electric regime controlsystem design in power systems. Research Report (Final). Kazakh State University; Government registration number 01816009920; Inventory number 02830031881. Alma-Ata, 1983, 42 pp. (in Russian). 184. Goldengorin B.I. Database structures optimization. Development and study of algorithms for the realization of inquiry languages for relational database control systems. Book 1: Research Report (Final). Kazakh State University, KMO.141; Government registration number 018290530 80; Inventory number 02830009011. Alma-Ata, 1983, 90 pp. (in Russian). 185. Goldengorin B. I. Optimization models and algorithms for the requirements of standards. Abstracts of Sc.D. thesis (Engineering Sciences). Institute of System Analysis, The USSR Academy of Sciences, Moscow, 1989, 15 pp., (in Russian). 186. Goldengorin B. I. Optimization models and algorithms for the requirements of standards. Sc.D. thesis (Engineering Sciences). Institute of System Analysis, The USSR Academy of Sciences, Moscow, 1989, 485 pp. (in Russian). 187. B. Goldengorin, G. Gutin. Polynomially Solvable Cases of the Supermodular Set Function Minimization Problems. Research Report TR/6/98. Department of Mathematics and Statistics, Brunel, The University of West London, London, United Kingdom, 1998, 5 pp. 188. B. Goldengorin, G. Sierksma, G. A. Tijssen, M. Tso. The Data-Correcting Algorithms for Supermodular Functions, with Applications to Quadratic Cost Partition and Simple Plant Location Problems. Research Report98A08, Graduate School / Research Institute Systems, Organizations and Management, University of Groningen, Groningen, The Netherlands, 1998. 189. B. Goldengorin, G. A. Tijssen, M. Tso. The Maximization of Submodular Functions: Old and New Proofs for the Correctness of the Dichotomy Algorithm. Research Report 99A17, Graduate School / Research Institute Systems, Organizations and Management, University of Groningen, Groningen, The Netherlands, 1999. (Cited by 18) 190. B. Goldengorin, Marius de Vink. Solving Large Instances of the Quadratic Cost Partition Problem on Dense Graphs by Data-Correcting Algorithm: a Computational Study. Research Report 99A50, Graduate School / Research Institute Systems, Organizations and Management, University of Groningen, Groningen, The Netherlands, 1999. 191. B. F. AlMohammad, B. Goldengorin, D. Ghosh, G. Sierksma. Equivalent Instances of the Simple Plant Location Problem. Research Report 00A54, Graduate School / Research Institute Systems, Organizations and Management, University of Groningen, Groningen, The Netherlands, 2000. (Cited by 7) 192. B. Goldengorin, D. Ghosh. The Binary Knapsack Problem: Solutions with Guaranteed Quality, Research Report 01A64, Graduate School / Research Institute Systems, Organizations and Management, University of Groningen, Groningen, The Netherlands, 2001. 193. B. Goldengorin, G. Sierksma. Combinatorial Optimization Tolerances Calculated in Linear Time. Research Report 03A30, Graduate School / Research Institute Systems, Organizations and Management, University of Groningen, Groningen, The Netherlands, 2003. (cited by 15) 194. A. Deza, B. Goldengorin, D. Pasechnik. The Isometries of the Cut, Metric and Hypermetric Cones. Research Report 03A24, Graduate School / Research Institute Systems, Organizations and Management, University of Groningen, 2003. 195. B. Goldengorin, D. Ghosh. A Multilevel Search Algorithm for the Maximization of Submodular Functions. Research Report 04A20, Graduate School / Research Institute Systems, Organizations and Management, University of Groningen, 2004. 196. B. Goldengorin, G. Jager. How To Make a Greedy Heuristic for the Asymmetric Traveling Salesman Problem Competitive. SOM Report 05A11, University of Groningen, The Netherlands, 2005, 16 pp. http://som.eldoc.\newline ub.rug. nl/reports/themeA/2005/05 A11/(Cited by 10) 197. P. Molitor, G. Jager, B. Goldengorin. Some Basics on Tolerances. SOM Report 05A13, University of Groningen, The Netherlands, 2005, 44 pp. http://som.eldoc.ub.rug.nl/reports/themeA/2005/05A13 198. B. Goldengorin, J. Keane and V. Kuzmenko \& M. Tso. Optimal Order Allocation with Discount Pricing. Probability and Statistics Group; School of Mathematics, The University of Manchester, United Kingdom, First version: 31, December 2006 Research Report No. 22, 2006, 22 pp. 199. Artem Fomin, Boris Goldengorin. An efficient model for the preemptive single machine scheduling of equal-length jobs. 2020, 22 pp. CoRR abs/2012.08152 (2020) https://arxiv.org/abs/2012.08152 200. Mikhail Cherniavskii, Boris Goldengorin. An improved KTNS algorithm for the job sequencing and tool switching problem. 2022, 17 pp. . CoRR abs/2205.06042 (2022) https://doi.org/10.48550/arXiv.2205.06042 201. Mikhail Cherniavskii, Boris Goldengorin. An almost linear time complexity algorithm for the Tool Loading Problem. 2022, CoRR abs/2207.02004 (2022) 202. Tendai Mapungwana Chikake, Boris Goldengorin, Alexey Samosyuk. Pseudo-Boolean Polynomials Approach To Edge Detection and Image Segmentation. 2023, 14 pp. CoRR abs/2308.15453 (2023) 203. Tendai Mapungwana Chikake, Boris Goldengorin. A Pseudo-Boolean Polynomials Approach for Image Edge Detection. 2023, 8 pp. CoRR abs/2308.15557 (2023) 204. Tendai Mapungwana Chikake, Boris Goldengorin. Dimensionality Reduction Using pseudo-Boolean polynomials For Cluster Analysis. 2023, 14 pp. CoRR abs/2308.15553 (2023)