检索结果-内蒙古大学图书馆

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

computational Mathematics and Mathematical Physics 2006年第12期46卷 2187-2202页

作者： Posypkin, M.A. Sigal, I.Kh. Institute of System Analysis Russian Academy of Sciences Moscow 117312 pr. Shestidesyatiletiya Oktyabrya 9 Russian Federation Computing Center Russian Academy of Sciences Moscow 119991 ul. Vavilova 40 Russian Federation

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered. © Nauka/Interperiodica 2006.

关键词： Algorithms for parallel computations Branch-and-bound method Discrete optimization model of the computation process Speedup estimate

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还