Abstract: Combinatorial Optimization is a well established area of mathematical models and algorithms. In this talk I am going to explain why data correcting and tolerance based algorithms leading to essential computational improvements either for polynomially solvable or NP-hard problems compared to well known branch-and-bound, branch-and-cut, and branch-and-cut-and-price algorithms. Another purpose of this talk is to attract the attention of research community to recently suggested iterative search strategy, namely Climer and Zhang's cut-and-solve (2006) approach, for solving integer linear programming problems by means of general-purpose software, like CPLEX.

Brief Biography of the Speaker:
*Boris Goldengorin* has the M.Sc. in Computer Science from the Radio Engineering University, Riazan, Russia; M.Sc. in Applied Mathematics from the Moscow University of Mathematics & Electronics; Ph.D. in Standardization and Production Quality Control from the National Institute of Standardization, Moscow, Russia; Sc.D. in Operations Research from the Institute of System Analysis, Russian Academy of Sciences, Moscow, Russia; Ph.D. in Economics from the University of Groningen, The Netherlands. He receives the title of Professor in Engineering Cybernetics from the Ministry of Science, High School and Engineering of Russian Federation, Moscow, Russia; Honorary Doctor of Science degree from the Khmelnitsky National University, Ukraine. Dr. Goldengorin is an author of two monographs, and two textbooks and his research articles published in Soviet Math. Doklady, Automation and Remote Control, Journal of Computer and Systems Sciences International (former Engineering Cybernetics), Management Science, Computers & Operations Research, Journal of Global Optimization, Discrete Optimization, Journal of Algebraic Combinatorics, Lecture Notes in Computer Science, European Journal of Operational Research, Handbook of Combinatorial Optimization, Theory of Optimization, Journal of Heuristics, Algorithmic Operations Research, Computers & Mathematics with Applications, Journal of Combinatorial Optimization and a number of other professional journals. Currently he is a Full Professor of Applied Mathematics Department, Khmelnitsky National University, Ukraine, and an Associate Professor of Operations Department, University of Groningen, The Netherlands (http://www.rug.nl/staff/b.goldengorin/index). He is affiliated to the Advanced Marketing Models Company (http://ammodelsinc.com/core_talent.html) in New York (USA).