Русский English Français
About HSE
Education
Research
News & Events

Quick links
About HSE → Faculty and staff → Boris Goldengorin
Boris Goldengorin
Contacts
E-mail:

Boris Goldengorin

Academic title:

Associate Professor, Professor

Education and degrees

Candidate of science: All-Soviet Union Research Institute of Normalization in Machine-Building under the Gosstandarrt of the USSR (defended in 1975, thesis: Mathematical models and evaluation algorithms for multiparameter assoprtment problems in industrial engineering)
Doctor of science: All-Soviet Union Institute of System Research of the Academy of Sciences of the USSR (defended in 1990, thesis: Mathematical models and algorithms for standard requirements optimization)
PhD: Rijksuniversiteit Groningen (defended in 2002, speciality: Discrete Mathematics and Mathematical Cybernetics, thesis: Data correcting algorithms in combinatorial optimization)
Doctor of science: Khmelnitskiy National University (defended in 2005, thesis: Honorary Doctor of Science)
Diploma: Moscow Institute of Electronic Engineering (graduated in 1973, faculty: Applied mathematics, speciality: Applied mathematics)
Diploma: Ryazan Radiotechnical Institute (graduated in 1967, faculty: Controlled Systems, speciality: Computer Science Hardware)

Publications

2012

Lower tolerance-based Branch and Bound algorithms for the ATSP
Germs R., B.Goldengorin, Turkensteen M.
// Computers & Operations Research, 2012. № 39(2). C. 291—298
[article]

2011

A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation
D.Krushinsky, B.Goldengorin
// Lecture Notes in Computer Science, 2011. № 6701. C. 503—516
[article]
Complexity evaluation of benchmark instances for the p-median problem
B.Goldengorin, D.Krushinsky
// Mathematical and Computer Modelling, 2011. Т. DOI: 10.1007/s10878-009-9251-8 (open access). № 9-10(53). C. 1719—1736
[article]
 MCM4365.pdf  Library of P-median instnces.rar Другие файлы...
Data aggregation for p-median problems
Albdaiwi B.F., Ghosh D., B.Goldengorin
// Journal of Combinatorial Optimization, 2011. № 3(21). C. 348—363
[article]
Optimal supplier choice with discounting
Tso M., Keane J., B.Goldengorin, V.N. Kuzmenko
// The Journal of Operational Research Society, 2011. № 62 (4). C. 690——699
[article]

2009

Equivalent instances of the simple plant location problem
Albdaiwi B.F., Sierksma G., B.Goldengorin
// Computers & Mathematics with Applications, 2009. Т. 57. № 5. C. 812—820
[article]
Synchronization of Movement for a Large-Scale Crowd. Chapter 6
A.Makarenko, B.Goldengorin, D.Krushinsky
В кн.: Recent Advances in Nonlinear Dynamics and Synchronization: Theory and Applications. New York: Springer, 2009
[chapter in a book]
МОДЕЛЬ КЛІТИННОГО АВТОМАТА З АНТИСИПАЦІЄЮ
Крушинский Д.А., Макаренко А.С., Гольденгорин Б.И.
// Наукові Вісті Національного технічного університету України "Київський політехнічний інститут", 2009. № 1. C. 30—35
[article]
Об оценках в задаче о р-медианах
Гольденгорин Б.И., Бойко В.В., Кузьменко В.Н.
// ТЕОРIЯ ОПТИМАЛЬНИХ РIШЕНЬ, 2009. № 8. C. 22—27
[article] Text of the publication is located on other web site

2008

Game of "Life" with Anticipation Property
A.Makarenko, D.Krushinsky, B.Goldengorin
// Lecture Notes in Computer Science, 2008. Т. 5191. C. 77—82
[article]

2007

Optimal order allocation with discount pricing
V.N. Kuzmenko, B.Goldengorin, Keane J., Tso M.
// Lecture Notes in Computer Science, 2007. № 4508. C. 273—284
[article]

2006

Iterative Patching and the Asymmteric Traveling Salesman Problem
Sierksma G., B.Goldengorin, Turkensteen M., Ghosh D.
// Discrete Optimization, 2006. № 3(1). C. 63—77
[article]
Some applications and prospects of cellular automata in traffic problems
A.Makarenko, Smilianec N., B.Goldengorin
// Lecture Notes in Computer Science, 2006. № 4173. C. 532—537
[article]
Some basics on tolerances
B.Goldengorin, Jager G., Molitor P.
// Lecture Notes in Computer Science, 2006. № 4041. C. 194—206
[article]
The isometrics of the cut, metric and hypermetric cones
B.Goldengorin, Deza A., D.V.Pasechnik
// Journal of Algebraic Combinatorics, 2006. № 23. C. 197—203
[article]
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
B.Goldengorin, Jager G., Molitor P.
// Lecture Notes in Computer Science, 2006. № 4235. C. 86—97
[article]
Tolerances applied in combinatorial optimization
B.Goldengorin, Molitor P., Jager G.
// Journal of Computer Science, 2006. № 2(9). C. 716—734
[article]

2005

Data correcting algorithms in combinatorial optimization.
Ghosh D., B.Goldengorin, Sierksma G.
В кн.: Handbook of Combinatorial Optimization. Berlin: Springer, 2005
[chapter in a book]
Data Correcting: A Methodology for Obtaining Near-Optimal Solutions
B.Goldengorin, Ghosh D., Sierksma G.
В кн.: Operations Research with Economic and Industrial Applications: Emerging Trends. New Delhi: Anamaya Publishers, 2005
[chapter in a book]
Using bipartite and multi-dimensional matching to select the rooots of a system of polynomial equations
Braad E.P., Bekker H., B.Goldengorin
// Lecture Notes in Computer Science, 2005. Т. 3483. C. 397—406
[article]

2004

Сравнение двух субградиентных методов при нахождении оценок для задач размещения
Гольденгорин Б.И., Стецюк П.И., Тсо М., Кузьменко В.Н.
// ТЕОРIЯ ОПТИМАЛЬНИХ РIШЕНЬ, 2004. № 3. C. 108—116
[article]

2003

Solving the Simple Plant Location Problem Using a Data Correcting Approach
B.Goldengorin, Ghosh D., Tijssen G.A., Sierksma G.
// Journal of Global Optimization, 2003. Т. 25. № 4. C. 377—406
[article]