Performance analysis of branch-and-bound skeletons

DOI10.1016/J.MCM.2009.08.003MaRDI QIDQ984170zbMATH OpenOpenAlexFDO

Authors I. Dorta, C. Rodríguez, Coromoto León

Publication date 16 July 2010

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mcm.2009.08.003

zbMATH Keywords

load balancingalgorithmic skeletonsbranch-and-bound technique

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18)

Recommendations

• Parallel Processing and Applied Mathematics
• Performance of parallel branch-and-bound algorithms
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Simple approaches to parallel branch and bound
• A study of parallel branch-and-bound algorithms with best-bound-first search

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• PICO: An object-oriented framework for parallel branch and bound
• Parallel Processing and Applied Mathematics

Cited in

(1)

• Parallel Processing and Applied Mathematics

Describes a project that uses

Uses Software

• R
• PICO
• SYMPHONY
• MPI
• Bob++

This page was built for publication: Performance analysis of branch-and-bound skeletons

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