کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1141415 1489495 2016 24 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات کنترل و بهینه سازی
پیش نمایش صفحه اول مقاله
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
چکیده انگلیسی

The branch-and-bound (B&B) algorithmic framework has been used successfully to find exact solutions for a wide array of optimization problems. B&B uses a tree search strategy to implicitly enumerate all possible solutions to a given problem, applying pruning rules to eliminate regions of the search space that cannot lead to a better solution. There are three algorithmic components in B&B that can be specified by the user to fine-tune the behavior of the algorithm. These components are the search strategy, the branching strategy, and the pruning rules. This survey presents a description of recent research advances in the design of B&B algorithms, particularly with regards to these three components. Moreover, three future research directions are provided in order to motivate further exploration in these areas.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Optimization - Volume 19, February 2016, Pages 79–102
نویسندگان
, , , ,