A Criterion of Optimality of Some Parallelization Scheme for Backtrack Search Problem in Binary Trees
- 8 January 2020
- book chapter
- Published by Springer Nature
- p. 455-464
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The lower bound on complexity of parallel branch-and-bound algorithm for subset sum problemAIP Conference Proceedings, 2016
- Space-efficient parallel algorithms for combinatorial search problemsJournal of Parallel and Distributed Computing, 2015
- Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problemJournal of Computer and Systems Sciences International, 2011
- On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound methodAutomation and Remote Control, 2010
- A framework for parallel large-scale global optimizationComputer Science - Research and Development, 2009
- Deterministic parallel backtrack searchTheoretical Computer Science, 2002
- Tight Bounds for On-Line Tree EmbeddingsSIAM Journal on Computing, 1999
- Randomized parallel algorithms for backtrack search and branch-and-bound computationJournal of the ACM, 1993
- Global multidimensional optimization on parallel computerParallel Computing, 1992