A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees

DOI10.1007/978-3-030-38603-0_33zbMath1477.90041OpenAlexW3000423763MaRDI QIDQ1982929

Mikhail A. Posypkin, Roman M. Kolpakov

Publication date: 14 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-38603-0_33

zbMATH Keywords

backtrack searchcomplexity analysisparallel tree search

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (1)

On the best choice of a branching variable in the subset sum problem

This page was built for publication: A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees