期刊
PARALLEL COMPUTING
卷 109, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.parco.2021.102874
关键词
Mixed integer linear programming; MIP; GPU; Domain propagation; Bound tightening; Parallel algorithms
The paper presents a novel, efficient GPU algorithm for domain propagation in state-of-the-art MIP solvers, achieving speed-ups of around 10x to 20x, up to 180x on favorably-large instances. Challenges include dynamic algorithmic behavior, dependency structures, and sparsity patterns. The algorithm can run entirely on the GPU with no CPU involvement.
center dot Currently, domain propagation in state-of-the-art MIP solvers is single thread only. center dot The paper presents a novel, efficient GPU algorithm to perform domain propagation. center dot Challenges are dynamic algorithmic behavior, dependency structures, sparsity patterns. center dot The algorithm is capable of running entirely on the GPU with no CPU involvement. center dot We achieve speed-ups of around 10x to 20x, up to 180x on favorably-large instances.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据