Speciality:
05.13.17 (Theoretical foundation for informatics)
Birth date:
26.01.1951
Phone: +431 427750660
E-mail: Website: https://www.mat.univie.ac.at/~oleg Keywords: local algorithms,
complexity,
discrete optimization,
nonserial dynamic programming.
UDC: 519.8, 519.658
Subject:
Discrete optimization,
global optimization,
postoptimal analysis,
local elimination algorithms,
constraint satisfaction.
Main publications:
A. Neumaier A., O. Shcherbina, “Safe bounds in linear and mixed-integer programming”, Math. Programming A, 99 (2004), 283–296
A. Neumaier A., O. Shcherbina, W. Huyer, T. Vinko, “A comparison of complete global optimization solvers”, Math. Programming B, 103 (2005), 335–356
O. Shcherbina, “Nonserial dynamic programming and tree decomposition in discrete optimization .”, Proceedings of Int. Conference on Operations Research “Operations Research 2006” (Karlsruhe, 6–8 September, 2006), Springer-Verlag, 2007, 155–160
O. Shcherbina, “Postoptimal analysis in nonserial dynamic programming”, Proceedings of Second International Conference MCO 2008 “Modelling, Computation and Optimization in Information Systems and Management Sciences” (Metz, France Luxembourg, September 8–10, 2008), Communications in Computer and Information Science, 14, Springer-Verlag, 2008, 308–317
O. Shcherbina, “Graph-Based Local Elimination Algorithms in Discrete Optimization”, Foundations of Computational Intelligence Volume 3. Global Optimization, Studies in Computational Intelligence, 203, ред. Abraham A., Hassanien A.-E., Siarry P., Engelbrecht A., Springer-Verlag, 2009, 235–266
