Parallel calculations in some problems of discrete optimization

G. I. Zabinyako, E. A. Kotel'nikov

Institute Computational Mathematics and Mathematical Geophisics SB RAS, Novosibirsk

Abstract: A parallel realization of the branch-and-bound method in problems of discrete optimization is considered. The productivity of paralleling is analyzed on the basis of experimental calculations for problems of integer linear and integer quadratic programming and set covering problems.

Received: 27.11.2007

Bibliographic databases:

• 
•