Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems

DOI10.1134/S0005117907050153zbMATH Open1161.68374WikidataQ126255146 ScholiaQ126255146MaRDI QIDQ2458085FDOQ2458085

Authors: Leonid Denisovich Popov 

Publication date: 31 October 2007

Published in: Automation and Remote Control (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1206103
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Efficiency considerations in the implementation of parallel branch-and- bound
• On parallel branch and bound frameworks for global optimization
• Performance of parallel branch-and-bound algorithms
• Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
• scientific article; zbMATH DE number 1489804
• scientific article; zbMATH DE number 934536
• Towards a heterogeneous and adaptive parallel branch-and-bound algorithm

zbMATH Keywords

distributed memorymultiprocessor computing systems

Mathematics Subject Classification ID

Computer system organization (68M99)

Cites Work

• An Algorithm for the Traveling Salesman Problem
• Title not available (Why is that?)
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• Parallel branch, cut, and price for large-scale discrete optimization
• On one approach to realization of the branch-and-bound method on a distributed system
• Optimization parallelizing for discrete programming problems
• Investigation of algorithms of parallel computations in knapsack-type discrete optimization problems

This page was built for publication: Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems

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