Speciality:
05.13.10 (Control for social and economical systems)
E-mail: Website: https://www.amazon.com/Boris-Goldengorin/e/B00AR073TE Keywords: 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
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
