Search Results - parallel branch‐and‐prune algorithms*

An autonomic parallel strategy for exhaustive search tree algorithms on shared or heterogeneous systems by Passos, Fernanda G. O., Rebello, Vinod E. F.

“…Summary Backtracking branch‐and‐prune (BP) algorithms and their variants are exhaustive search tree techniques widely employed to solve optimization problems in many scientific areas…”
Get full text

A double-decomposition based parallel exact algorithm for the feedback length minimization problem by Shang, Zhen, Hao, Jin-Kao, Ma, Fei

“… This study develops a double-decomposition based parallel branch-and-prune algorithm, to determine the optimal activity sequence that minimizes the total feedback length (FLMP…”
Get full text

A branch and prune algorithm for the computation of generalized aspects of parallel robots by Caro, S., Chablat, D., Goldsztejn, A., Ishii, D., Jermann, C.

“…Parallel robots enjoy enhanced mechanical characteristics that have to be contrasted with a more complicated design…”
Get full text

Scheduling interrelated activities in complex projects under high-order rework: A DSM-based approach by Wen, Muchen, Lin, Jun, Qian, Yanjun, Huang, Weihao

“…•A parallel branch-and-prune algorithm, which is able to obtain optimal solutions for medium instances…”
Get full text

A parallel version of the Branch & Prune algorithm for the Molecular Distance Geometry Problem by Mucherino, A, Lavor, C, Liberti, L, Talbi, E.-G

“… When particular assumptions are satisfied, the problem can be discretized, and solved by employing an ad-hoc algorithm called Branch & Prune (BP…”
Get full text

A double-decomposition based parallel exact algorithm for the feedback length minimization problem by Shang, Zhen, Jin-Kao, Hao, Ma, Fei

“… This study develops a double-decomposition based parallel branch-and-prune algorithm, to determine the optimal activity sequence that minimizes the total feedback length (FLMP…”
Get full text

Exact algorithms for the feedback length minimisation problem by Shang, Zhen, Zhao, Songzheng, Qian, Yanjun, Lin, Jun

“… First, we present two new properties of the problem. Second, based on the properties, we develop an efficient Parallel Branch-and-Prune algorithm (PBP…”
Get full text

A Parallel BP Algorithm for the Discretizable Distance Geometry Problem by Gramacho, W., Mucherino, A., Lavor, C., Maculan, N.

“…We propose a parallel version of the Branch & Prune (BP) algorithm for the Discretizable Distance Geometry Problem (DDGP…”
Get full text

Efficient Enumeration of Large Maximal k-Plexes by Cheng, Qihao, Yan, Da, Wu, Tianhao, Yuan, Lyuheng, Cheng, Ji, Huang, Zhongyi, Zhou, Yang

“… In this paper, we propose a fast branch-and-bound algorithm as well as its task-based parallel version to enumerate all maximal \(k…”
Get full text