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

DOI10.1016/J.JCSS.2014.06.012MaRDI QIDQ743112zbMATH OpenOpenAlexFDO

Authors 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

GPU computingheterogeneous computingmulti-core computingparallel branch-and-bound algorithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1163098
• On parallel branch and bound frameworks for global optimization
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Simple approaches to parallel branch and bound
• scientific article; zbMATH DE number 934536

Cites work

• Branch-and-Bound interval global optimization on shared memory multiprocessors
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Optimal two- and three-stage production schedules with set-up time included

Cited in

(9)

• Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
• Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
• scientific article; zbMATH DE number 5168311 (Why is no real title available?)
• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
• scientific article; zbMATH DE number 1057779 (Why is no real title available?)
• Using of OpenMP for optimal choice of process equipment for multiproduct batch plants
• Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers
• Parallel branch-and-price algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times
• PEBBL: an object-oriented framework for scalable parallel branch and bound

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743112)