• Organization of parallel calcu...

Result: Organization of parallel calculations in some problems of discrete optimization

Title:
Organization of parallel calculations in some problems of discrete optimization
Authors:
G. I. Zabinyako, E. A. Kotel’nikov
Source:
Numerical Analysis and Applications. 1:339-346
Publisher Information:
Pleiades Publishing Ltd, 2008.
Publication Year:
2008
Subject Terms:
branch and bound method, 05 social sciences, 0211 other engineering and technologies, asynchronous process, Integer programming, Parallel numerical computation, 02 engineering and technology, Quadratic programming, parallel calculations, algorithms, integer linear programming, integer quadratic programming, Numerical mathematical programming methods, Linear programming, 0502 economics and business, Polyhedral combinatorics, branch-and-bound, branch-and-cut, discrete optimization, problem of set covering, numerical experiments
Document Type:
Academic journal Article
File Description:
application/xml
Language:
English
ISSN:
1995-4247
1995-4239
DOI:
10.1134/s1995423908040046
Access URL:
https://zbmath.org/5801010
https://doi.org/10.1134/s1995423908040046
https://link.springer.com/article/10.1134/S1995423908040046
Rights:
Springer TDM
Accession Number:
edsair.doi.dedup.....18056be2da12c543b53a4bf47f3f1fa9
Database:
OpenAIRE

Further Information

Summary: The organization of parallel calculations with the use of the MPI functions in problems of discrete optimization is considered. The branch and bound method is applied to problems of the integer linear and the integer quadratic programming, as well as to problems of set covering. The efficiency of the algorithms is analyzed on the basis of numerical experiments.