Boris Goldengorin
Boris Goldengorin
Professor of Operations Research, University of Florida
Подтвержден адрес электронной почты в домене hse.ru - Главная страница
Название
Процитировано
Процитировано
Год
The data-correcting algorithm for the minimization of supermodular functions
B Goldengorin, G Sierksma, GA Tijssen, M Tso
Management Science 45 (11), 1539-1551, 1999
651999
Branch and peg algorithms for the simple plant location problem
B Goldengorin, D Ghosh, G Sierksma
Computers & Operations Research 30 (7), 967-981, 2003
592003
Improvements to MCS algorithm for the maximum clique problem
M Batsyn, B Goldengorin, E Maslov, PM Pardalos
Journal of Combinatorial Optimization 27 (2), 397-416, 2014
492014
Tolerance-based branch and bound algorithms for the ATSP
M Turkensteen, D Ghosh, B Goldengorin, G Sierksma
European Journal of Operational Research 189 (3), 775-788, 2008
472008
Network approach for the Russian stock market
A Vizgunov, B Goldengorin, V Kalyagin, A Koldanov, P Koldanov, ...
Computational Management Science 11 (1-2), 45-55, 2014
452014
Lower tolerance-based branch and bound algorithms for the ATSP
R Germs, B Goldengorin, M Turkensteen
Computers & Operations Research 39 (2), 291-298, 2012
422012
Tolerances applied in combinatorial optimization
B Goldengorin, G Jäger, P Molitor
J. Comput. Sci 2 (9), 716-734, 2006
382006
Solving the simple plant location problem using a data correcting approach
B Goldengorin, GA Tijssen, D Ghosh, G Sierksma
Journal of Global Optimization 25 (4), 377-406, 2003
372003
Branch and peg algorithms for the simple plant location problem
B Goldengorin, D Ghosh, G Sierksma
Computers & Operations Research 31 (2), 241-255, 2004
352004
Requirements of standards: optimization models and algorithms
B Goldengorin
Russian Operation Research Company, 1995
321995
Cell formation in industrial engineering
B Goldengorin, D Krushinsky, PM Pardalos
Springer, 2013
292013
Worst case analysis of max-regret, greedy, and other heuristics for multidimensional assignment and traveling salesman problems
G Gutin, B Goldengorin, H J.
Journal of Heuristics, 169 - 181, 2008
292008
An exact model for cell formation in group technology
D Krushinsky, B Goldengorin
Computational Management Science 9 (3), 323-338, 2012
272012
Data aggregation for p-median problems
BF Albdaiwi, D Ghosh, B Goldengorin
Journal of Combinatorial Optimization 21 (3), 348-363, 2011
262011
Flexible PMP approach for large-size cell formation
B Goldengorin, D Krushinsky, J Slomp
Operations research 60 (5), 1157-1166, 2012
252012
Complexity evaluation of benchmark instances for the p-median problem
B Goldengorin, D Krushinsky
Mathematical and Computer Modelling 53 (9-10), 1719-1736, 2011
252011
Tolerance based algorithms for the ATSP
B Goldengorin, G Sierksma, M Turkensteen
International Workshop on Graph-Theoretic Concepts in Computer Science, 222-234, 2004
252004
Biocomputing
PM Pardalos, JC Príncipe
Springer Science & Business Media, 2013
232013
Using bipartite and multidimensional matching to select the roots of a system of polynomial equations
H Bekker, EP Braad, B Goldengorin
International Conference on Computational Science and Its Applications, 397-406, 2005
222005
Improving the efficiency of Helsgaun’s Lin-Kernighan heuristic for the symmetric TSP
D Richter, B Goldengorin, G Jäger, P Molitor
Workshop on Combinatorial and Algorithmic Aspects of Networking, 99-111, 2007
212007
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20