Results 311 to 320 of about 244,573 (375)
Some of the next articles are maybe not open access.
Parallel Branch-and-Branch Algorithms: Survey and Synthesis
Operations Research, 1994We present a detailed and up-to-date survey of the literature on parallel branch-and-bound algorithms. We synthesize previous work in this area and propose a new classification of parallel branch-and-bound algorithms. This classification is used to analyze the methods proposed in the literature.
Gendron, Bernard +1 more
openaire +2 more sources
Dual bounding procedures lead to convergent Branch–and–Bound algorithms
Mathematical Programming, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
A randomized parallel branch-and-bound algorithm
International Journal of Parallel Programming, 1988Randomized algorithms are algorithms that employ randomness in their solution method. We show that the performance of randomized algorithms is less affected by factors that prevent most parallel deterministic algorithms from attaining their theoretical speedup bounds.
Janakiram, Virendra K. +3 more
openaire +1 more source
A branch and bound clustering algorithm
IEEE Transactions on Systems, Man, and Cybernetics, 1995We discuss the clustering problem in a 0-1 matrix in this paper. Although clustering algorithms are available in the literature, many of them cannot produce a solution matrix in a desirable structure. Therefore, additional computation or user intervention is required to obtain submatrices (i.e., clusters) from a solution matrix. To solve the clustering
openaire +1 more source
Algorithmic Skeletons for Branch and Bound
2008Algorithmic skeletons are predefined components for parallel programming. We will present a skeleton for branch & bound problems for MIMD machines with distributed memory. This skeleton is based on a distributed work pool. We discuss two variants, one with supply-driven work distribution and one with demand-driven work distribution.
Michael Poldner, Herbert Kuchen
openaire +1 more source
A Branch-and-Bound Algorithm with Reduced Search Space for Sparse Filter Design
Asia Pacific Conference on Circuits and Systems, 2018This paper presents a branch-and-bound algorithm with reduced search space for sparse FIR filter design. To estimate the possibilities of zero positions, the second-order zero coefficients combinations are evaluated.
Wangqian Chen, Mo Huang, Xin Lou
semanticscholar +1 more source
Performance of parallel branch-and-bound algorithms
IEEE Transactions on Computers, 1985We study the performance of parallel best-bound-first branch-and-bound algorithms, in which several nodes with least lower bounds are expanded simultaneously. It is well known that anomalies may occur in the execution of a parallel branch-and-bound algorithm.
Lai, Ten-Hwang, Sprague, Alan
openaire +1 more source
2002
This chapter describes a time-oriented, constraint propagation based approach to resource-constrained project scheduling with generalised precedence constraints. We present a branch-and-bound algorithm for the general problem PS |temp| C max that enumerates possible activity start times based on the idea that, at a given node of the search tree, an ...
openaire +1 more source
This chapter describes a time-oriented, constraint propagation based approach to resource-constrained project scheduling with generalised precedence constraints. We present a branch-and-bound algorithm for the general problem PS |temp| C max that enumerates possible activity start times based on the idea that, at a given node of the search tree, an ...
openaire +1 more source
1994
Whereas exact methods for solving the single-mode resource-constrained project scheduling problem are well documented in the literature (cf. e.g. [7], [18], [25], [27], [32], [33], [33], [95], [101], [112], [113]), the multi-mode extension has attracted less attention (cf. [88], [89], [109], [114], [115], [116]).
openaire +1 more source
Whereas exact methods for solving the single-mode resource-constrained project scheduling problem are well documented in the literature (cf. e.g. [7], [18], [25], [27], [32], [33], [33], [95], [101], [112], [113]), the multi-mode extension has attracted less attention (cf. [88], [89], [109], [114], [115], [116]).
openaire +1 more source
Branch-and-bound algorithms on a hypercube
Proceedings of the third conference on Hypercube concurrent computers and applications -, 1988The parallel implementation of branch-and-bound algorithms on multiprocessors has received an increasing amount of attention in recent years. This paper describes research currently being conducted at Clemson University. We study the job scheduling problem: given n jobs, each with processing time, pi, and due date, di, schedule these jobs on a single ...
R. P. Pargas, D. E. Wooster
openaire +1 more source