Results 221 to 230 of about 25,776 (266)
Some of the next articles are maybe not open access.
An asynchronous parallel branch‐and‐bound algorithm
Systems and Computers in Japan, 1992AbstractThis paper presents a parallel branch‐and‐bound algorithm which is applicable to a loosely coupled multiprocessor with nonhierarchical interconnection network such as torus or hypercube. This algorithm is asynchronous and processing elements (PEs) start evaluation of nodes without being synchronized.
Tsuyoshi Kawaguchi +2 more
openaire +2 more sources
A Branch and Bound Algorithm for Numerical MAX-CSP
Constraints, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Normand, Jean-Marie +3 more
openaire +5 more sources
Embedding Branch and Bound within Evolutionary Algorithms
Applied Intelligence, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carlos Cotta, José M. Troya
openaire +3 more sources
Evaluation of a Branch and Bound Algorithm for Clustering
SIAM Journal on Scientific and Statistical Computing, 1985From author's summary: A branch and bound algorithm for optimal clustering is developed and applied to a variety of test problems. The objective function is minimization of within-group sum-of-squares although the algorithm can be applied to loss functions which meet certain conditions.
openaire +1 more source
Hierarchical branch and bound algorithm for computational grids
Future Generation Computer Systems, 2012Branch and Bound (B&B) algorithms are efficiently used for exact resolution of combinatorial optimization problems (COPs). They are easy to parallelize using the Master/Worker paradigm (MW) but limited in scalability when solving large instances of COPs on large scale environments such as computational grids.
Bendjoudi, Ahcène +2 more
openaire +4 more sources
A parallel branch and bound algorithm for test generation
Proceedings of the 1989 26th ACM/IEEE conference on Design automation conference - DAC '89, 1989For circuits of VLSI complexity, test generation time can be prohibitive. Most of the time is consumed by hard-to-detect (HTD) faults, which might remain undetected even after a large number of backtracks. The problems inherent in a uniprocessor implementation of a test generation algorithm are identified, and a parallel test generation method which ...
Srinivas Patil, Prithviraj Banerjee
openaire +1 more source
A Branch and Bound Algorithm for Feature Subset Selection
IEEE Transactions on Computers, 1977A feature subset selection algorithm based on branch and bound techniques is developed to select the best subset of m features from an n-feature set. Existing procedures for feature subset selection, such as sequential selection and dynamic programming, do not guarantee optimality of the selected feature subset. Exhaustive search, on the other hand, is
Patrenahalli M. Narendra +1 more
openaire +2 more sources
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
Genetic Branch-and-Bound or Exact Genetic Algorithm?
2008Production resettings is a vital element of production flexibilityand optimizing the setup tasks scheduling within a productionchannel is required to improve production rate. This paper deals with aNP-Hard production resetting optimization problem based on an industrialcase.
Pessan, Cédric +2 more
openaire +2 more sources
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