Towards a heterogeneous and adaptive parallel branch-and-bound algorithm

DOI10.1016/j.jcss.2014.06.012zbMath1410.68378OpenAlexW2046111194MaRDI QIDQ743112

I. Chakroun, Nouredine Melab

Publication date: 22 September 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.06.012

zbMATH Keywords

heterogeneous computingGPU computingmulti-core computingparallel branch-and-bound algorithms

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10)

Related Items (2)

Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions

Cites Work

• Unnamed Item
• Optimal two- and three-stage production schedules with setup times included
• Branch-and-Bound interval global optimization on shared memory multiprocessors

This page was built for publication: Towards a heterogeneous and adaptive parallel branch-and-bound algorithm