Results 301 to 310 of about 244,573 (375)
Some of the next articles are maybe not open access.
A Branch-and-Bound Algorithm for Pagination
Operations Research, 1975The paper presents an algorithm for partitioning the nodes of a weighted graph in order to minimize the interset weights. The algorithm is patterned after the branch-and-probabilistic-bound procedures of Graves and Whinston. Final partitions or solutions are characterized by probability statements like: “the probability is greater than α that a ...
Duncan, John, Scott, Lawrence W.
openaire +1 more source
A Branch-and-Bound Algorithm For The Problem of Scheduling With a Conflict Graph
2020 International Conference on Decision Aid Sciences and Application (DASA), 2020The problem of scheduling n unit-time jobs on m uniform machines is raised in this paper. The jobs are subject to conflicting constraints modeled by a graph G, called the conflict graph.
Amin Mallek, Mourad Boudhar
semanticscholar +1 more source
A simple unified branch-and-bound algorithm for minimum zone circularity and sphericity errors
Measurement science and technology, 2020This paper presents a simple branch-and-bound (B&B) algorithm to compute the minimum zone circularity/sphericity error, which is formulated as the problem of finding the centers of two concentric circles/spheres that contain given points between them and
Yu Zheng
semanticscholar +1 more source
1984
A solution technique for discrete optimisation problems which is widely used outside Al and is closely related to the A* algorithm . The task is to find the optimally valued tip of a walkable search tree. A subtree of the search tree need not be searched if a computation at its root yields a bound for its set of tip values which implies that none of ...
Alan Bundy, Lincoln Wallen
openaire +1 more source
A solution technique for discrete optimisation problems which is widely used outside Al and is closely related to the A* algorithm . The task is to find the optimally valued tip of a walkable search tree. A subtree of the search tree need not be searched if a computation at its root yields a bound for its set of tip values which implies that none of ...
Alan Bundy, Lincoln Wallen
openaire +1 more source
A Branch and Bound Algorithm for Scheduling of Flexible Manufacturing Systems
IEEE Transactions on Automation Science and EngineeringFlexible manufacturing systems (FMSs), which can easily adapt to changes in job types, have been widely used in manufacturing areas. Scheduling of FMSs is a variant of a flexible job shop with transport robots and no buffer, and it is extremely hard as ...
Jeongsun Ahn, Hyun-Jung Kim
semanticscholar +1 more source
Constrained Branch-and-Bound algorithm for image registration
Journal of Zhejiang University-SCIENCE A, 2005Summary: The authors propose a refined branch-and-bound algorithm for affine-transformation based image registration. Given two feature point-sets in two images respectively, the authors first extract a sequence of high-probability matched point-pairs by considering well-defined features. Each resultant point-pair can be regarded as a constraint in the
Jin, Jianqui +2 more
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 +3 more sources
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 +3 more sources
Multi-View Global 2D-3D Registration Based on Branch and Bound Algorithm
IEEE International Conference on Robotics and Biomimetics, 2019In image-guided minimally invasive surgery, the clinician relies on image guidance to observe, plan and navigate. In order to show invisible vessels or planning annotations in live X-ray images, or update the live information for planning, the ...
Jin Pan +4 more
semanticscholar +1 more source
Branch and bound algorithm for the Bayes classifier
Proceedings of 13th International Conference on Pattern Recognition, 1996Given the feature vector from an unknown class, the branch and bound algorithm (BAB) is very efficient for finding the nearest neighbor among the set of reference vectors. The Euclidean distance measure is adopted. In this article, the BAB algorithm is extended so that it can be used with the Bayes classifier which uses the probability measure instead ...
Sze, L, Leung, CH
openaire +2 more sources