The scalability analysis of a parallel tree search algorithm

DOI10.1007/S11590-020-01547-6zbMATH Open1462.90098OpenAlexW3021108801MaRDI QIDQ5919087FDOQ5919087

Authors: Roman Kolpakov, M. A. Posypkin 

Publication date: 17 February 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01547-6

Recommendations

• The scalability analysis of a parallel tree search algorithm
• scientific article; zbMATH DE number 934532
• scientific article; zbMATH DE number 2087981
• Scalability and parallelization of Monte-Carlo tree search
• Parallel depth first search. II: Analysis

zbMATH Keywords

global optimizationcomplexity analysisparallel scalabilityparallel efficiencyparallel tree search

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Analysis of algorithms (68W40) Nonconvex programming, global optimization (90C26) Parallel algorithms in computer science (68W10)

Cites Work

• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• Estimating the Efficiency of Backtrack Programs
• A parallel branch and bound algorithm for the quadratic assignment problem
• Global optimization: Fractal approach and non-redundant parallelism
• Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives
• Parallel global optimization on GPU
• Title not available (Why is that?)
• Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem
• Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
• On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method
• The scalability analysis of a parallel tree search algorithm
• Global multidimensional optimization on parallel computer
• Branch-and-Bound interval global optimization on shared memory multiprocessors
• Tight Bounds for On-Line Tree Embeddings
• Approximating a solution set of nonlinear inequalities

Cited In (6)

• Анализ сложности алгоритма параллельного поиска “золотой” коллизии
• Title not available (Why is that?)
• Parallel depth first search. I: Implementation
• Evaluation of a simple, scalable, parallel best-first search strategy
• Title not available (Why is that?)
• On the scalability of PSRS algorithm

This page was built for publication: The scalability analysis of a parallel tree search algorithm

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