Výsledky vyhledávání - "parallel branch‐and‐prune algorithms"

An autonomic parallel strategy for exhaustive search tree algorithms on shared or heterogeneous systems Autor 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…”
Získat plný text

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

“…•A parallel branch-and-prune algorithm, which is able to obtain optimal solutions for medium instances…”
Získat plný text

A double-decomposition based parallel exact algorithm for the feedback length minimization problem Autor 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…”
Získat plný text

Exact algorithms for the feedback length minimisation problem Autor 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…”
Získat plný text

A double-decomposition based parallel exact algorithm for the feedback length minimization problem Autor 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…”
Získat plný text