scientific article; zbMATH DE number 1163098

MaRDI QIDQ4394587zbMATH OpenFDO

Authors Jens Clausen

Publication date 29 July 1998

zbMATH Keywords

branch-and-boundgraph partitioningparallel algorithmsquadratic assignment

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Simple approaches to parallel branch and bound
• Anomalies in parallel branch-and-bound algorithms
• scientific article; zbMATH DE number 934536
• Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
• Can Parallel Branch and Bound without Communication Be Effective?

Cited in

(24)

• Branch-and-bound and parallel computation: A historical note
• A simulation tool for the performance evaluation of parallel branch and bound algorithms
• Parallel processing for difficult combinatorial optimization problems
• Experiments with parallel branch-and-bound algorithms for the set covering problem
• Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
• Parallel branch, cut, and price for large-scale discrete optimization
• On estimating workload in interval branch-and-bound global optimization algorithms
• PICO: An object-oriented framework for parallel branch and bound
• Template realization of generalized branch and bound algorithm
• Anomalies in parallel branch-and-bound algorithms
• Can Parallel Branch and Bound without Communication Be Effective?
• scientific article; zbMATH DE number 2080143 (Why is no real title available?)
• Using of OpenMP for optimal choice of process equipment for multiproduct batch plants
• scientific article; zbMATH DE number 2087412 (Why is no real title available?)
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• scientific article; zbMATH DE number 934535 (Why is no real title available?)
• scientific article; zbMATH DE number 934536 (Why is no real title available?)
• BiqBin: moving boundaries for NP-hard problems by HPC
• Parallel Processing and Applied Mathematics
• AND/OR branch-and-bound on a computational grid
• On the benefits of using NP-hard problems in branch \& bound
• On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method
• Towards a heterogeneous and adaptive parallel branch-and-bound algorithm
• PEBBL: an object-oriented framework for scalable parallel branch and bound

This page was built for publication:

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