Branch-and-Bound Search
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models
... AND/OR Branch-and-Bound algorithms ( AOBB ) that explore the AND/OR search tree in a depth-first manner for solving optimization problems in graphical ...traditional Branch-and- Bound ...
35
Source side Preordering for Translation using Logistic Regression and Depth first Branch and Bound Search
... depth-first branch-and-bound search through the space of possible children per- mutations, avoiding using a cascade of classifiers or limiting the list of possi- ble ordering ...
10
A novel approach to hyperspectral band selection based on spectral shape similarity analysis and fast branch and bound search
... a b s t r a c t With the development of hyperspectral remote sensing technology, the spectral resolution of the hyperspectral image data becomes denser, which results in large number of bands, high correlation between ...
10
AN EFFICIENT BRANCH AND BOUND SEARCH ALGORITHM MULTIDIMENSIONAL VECTOR SPACE FOR COMPUTING K NEAREST NEIGHBORS IN A. 2 Decomposition of the Sample
... efficient branch and bound search algorithm is proposed for the computation of the K nearest neighbors in a multi- dimensional vector ...the search of the nearest neighbors, the tree that ...
6
Replicable parallel branch and bound search
... the search tree segments S 0 , S 1 and S 2 in ...the search tree where traversal stopped due to pruning; column cut off list the positions that were never reached due to ...
24
Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation
... tree search procedure as if they had been obtained ...the search, supposing that samples are inde- pendent equates to supposing that the first or latest samples observed are equally good predictors of the ...
8
Learning Chordal Markov Networks via Branch and Bound
... new branch-and-bound approach to learning optimal chordal Markov network structures, ...core branch-and-bound search, the approach integrates dynamic programming for obtaining tight ...
11
Cyclic best first search in branch-and-bound algorithms
... a branch-and-bound (B&B) algorithm to solve this problem, which we will refer to as ...the search tree represents a subset of vertices in a fixed sequence and branching is done by inserting a ...
123
A new branch-and-bound procedure for computing optimal search paths
... Convective heat transfer characteristics of a liquid cooled rectangular channel, containing offset plate fins were investigated experimentally.. The selected geometry was [r] ...
50
Hybridising local search with Branch-and-Bound for constrained portfolio selection problems
... algorithm; Branch-and-Bound; local search; portfolio selection problems ABSTRACT In this paper, we investigate a constrained portfolio selection problem with cardinality constraint, minimum size and ...
8
Hybridising local search with Branch and Bound for constrained portfolio selection problems
... algorithm; Branch-and-Bound; local search; portfolio selection problems ABSTRACT In this paper, we investigate a constrained portfolio selection problem with cardinality constraint, minimum size and ...
7
EROS-DOCK: Protein-Protein Docking Using Exhaustive Branch-and-Bound Rotational Search
... FFT-based search algorithms while still using a sensitive physics-based CG scoring ...efficient branch-and-bound based search algorithms for the problem of finding the optimal registration of ...
10
Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
... Tabu search: In order to determine the best performing neighborhoods, a computational experiment was performed by running the TS with the different NHs restrictions discussed in Section ...final search for ...
30
New methods for branch-and-bound algorithms
... Therefore, the natural question is “What heuristic labeling functions lead to good performance for B&B algorithms in practice?” 3.3.1 Relative Properties of the Labeling Function It is important to note that the behavior ...
124
Load Balancing for Parallel Branch and Bound
... underlying search space are not effective in practice, since performance is dominated by the pruning power of ...explored search space using an exponential functional form using certain subproblem ...
15
A branch-and-bound method for absolute value programs
... In Step 1, a certain rule should be used to choose an active subproblem P(I, J ) ∈ A. In the numerical experiments reported in the next section, we use the depth-first search, which generally chooses an active ...
14
Nurse Scheduling Based on Branch- and- Bound Algorithm
... In the field of nurse rostering, some decomposition techniques have been investigated over recent passed years. Aickelin and Dowsland [24] developed a genetic algorithm with an indirect representation. Different ...
7
Parallelization of a Branch and Bound Algorithm on Multicore Systems
... the search for lower bounds, the use of parallelism has a better chance of speeding up the execution of the algorithm and has emerged as an attractive way of solving larger problems ...
9
A BRANCH AND BOUND ALGORITHM FOR RESOURCE LEVELING PROBLEM
... Year of PublicationAuthor(s)MethodProblem(s)Remarks 1997MattilaInteger Linear ProgrammingRLPLeveling for Linear Schedules via Integer Linear Programming. 1997Demeulemeester and HerroelenBranch and BoundRCPSPDepth first ...
121
APPLICATION OF BRANCH AND BOUND ALGORITHM IN A BOTTLING SYSTEM
... The Branch-and-Bound algorithm is one of the tools commonly used in obtaining optimal solutions in these kinds of ...The Branch and bound algorithm is an algorithm design which is used in ...
13