Branch and bound on the network model

DOI10.1007/3-540-60692-0_37MaRDI QIDQ6487178zbMATH OpenFDO

Authors Sanjay Jain

Publication date 19 January 2017

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10)

Recommendations

• Branch and bound on the network model
• Deterministic branch-and-bound on distributed memory machines
• Simple approaches to parallel branch and bound
• Anomalies in parallel branch-and-bound algorithms
• A randomized parallel branch-and-bound algorithm

Cited in

(9)

• Tree search on an atomic model for message passing
• Branch-and-bound and backtrack search on mesh-connected arrays of processors
• Branch and bound on the network model
• A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master–Slave Architecture
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• Random Trees and the Analysis of Branch and Bound Procedures
• A randomized parallel branch-and-bound algorithm
• Deterministic branch-and-bound on distributed memory machines
• An analysis of budgeted parallel search on conditional Galton-Watson trees

This page was built for publication: Branch and bound on the network model

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