A GPU-based Branch-and-Bound algorithm using Integer–Vector–Matrix data structure
نویسندگان
چکیده
منابع مشابه
A GPU-based Branch-and-Bound algorithm using Integer-Vector-Matrix data structure
Branch-and-Bound (B&B) algorithms are tree-based exploratory methods for solving combinatorial optimization problems exactly to optimality. These problems are often large in size and known to be NP-hard to solve. The construction and exploration of the B&B-tree are performed using four operators: branching, bounding, selection and pruning. Such algorithms are irregular which makes their paralle...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملA branch and bound algorithm for protein structure refinement from sparse NMR data sets.
We describe new methods for predicting protein tertiary structures to low resolution given the specification of secondary structure and a limited set of long-range NMR distance constraints. The NMR data sets are derived from a realistic protocol involving completely deuterated 15N and 13C-labeled samples. A global optimization method, based upon a modification of the alphaBB (branch and bound) ...
متن کاملA Distance-Based Branch and Bound Feature Selection Algorithm
There is no known efficient method for selecting k Gaussian features from n which achieve the lowest Bayesian classification error. We show an example of how greedy algorithms faced with this task are led to give results that are not optimal. This motivates us to propose a more robust approach. We present a Branch and Bound algorithm for finding a subset of k independent Gaussian features which...
متن کاملAn Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2016
ISSN: 0167-8191
DOI: 10.1016/j.parco.2016.01.008