SelfSplit parallelization for mixed-integer linear programming

被引：1
|
作者：
Fischetti, Matteo [1 ]
Monaci, Michele [2 ]
Salvagnin, Domenico [1 ]
机构：
[1] Univ Padua, DEI, Padua, Italy
[2] Univ Bologna, DEI, Bologna, Italy
来源：
COMPUTERS & OPERATIONS RESEARCH | 2018年 / 93卷
关键词：
Parallel computing; Enumerative algorithms; Mixed-integer programming; Computational analysis; BOUND ALGORITHMS; BRANCH; COMMUNICATION; OPTIMIZATION;
D O I：
10.1016/j.cor.2018.01.011
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
SelfSplit is a simple static mechanism to convert a sequential tree-search code into a parallel one. In this paradigm, tree-search is distributed among a set of identical workers, each of which is able to autonomously determine-without any communication with the other workers-the job parts it has to process. SelfSplit already proved quite effective in parallelizing Constraint Programming solvers. In the present paper we investigate the performance of SelfSplit when applied to a Mixed-Integer Linear Programming (MILP) solver. Both ad-hoc and general purpose MILP codes have been considered. Computational results show that SelfSplit, in spite of its simplicity, can achieve good speedups even in the MILP context. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码：101 / 112
页数：12
相关论文
共 50 条
12345