How Much Communication Does Parallel Branch and Bound Need?

DOI10.1287/IJOC.9.1.15MaRDI QIDQ4367039zbMATH OpenOpenAlexFDO

Authors Jonathan Eckstein

Publication date 25 November 1997

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.9.1.15

zbMATH Keywords

branch-and-boundparallel implementations

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Mixed integer programming (90C11)

Recommendations

• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
• Can Parallel Branch and Bound without Communication Be Effective?
• scientific article; zbMATH DE number 1206103

Cited in

(3)

• Can Parallel Branch and Bound without Communication Be Effective?
• A two-stage parallel branch and bound algorithm for mixed integer programs
• PEBBL: an object-oriented framework for scalable parallel branch and bound

Describes a project that uses

Uses Software

• MIPLIB

This page was built for publication: How Much Communication Does Parallel Branch and Bound Need?

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