Parallelizing some problems of the discrete and the non-convex optimization

This paper considers aspects of parallelizing of the solution process of problems of the integer linear and quadratic programming as well as of problems of global optimization of the non-convex quadratic programming.