Results 141 to 150 of about 915,013 (232)

Branch-and-Bound Methods: A Survey

Operations Research, 1966
The essential features of the branch-and-bound approach to constrained optimization are described, and several specific applications are reviewed. These include integer linear programming (Land-Doig and Balas methods), nonlinear programming (minimization of nonconvex objective functions), the traveling-salesman problem (Eastman and Little, et al ...
Lawler, E. L., Wood, D. E.
openaire   +3 more sources

Branch and Bound

ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems, 2017
C. Geyer
openaire   +2 more sources

AB&B: An Anytime Branch and Bound Algorithm for Scheduling of Deadlock-Prone Flexible Manufacturing Systems

IEEE Transactions on Automation Science and Engineering, 2021
This work investigates a scheduling problem of deadlock-prone flexible manufacturing systems modeled by place-timed Petri nets. It proposes an anytime branch and bound (AB&B) algorithm for it to minimize system makespan based on the branch tree of a net ...
Jianchao Luo, Mengchu Zhou, Jun-qiang Wang   +2 more
semanticscholar   +1 more source

Efficient and Outlier-Robust Simultaneous Pose and Correspondence Determination by Branch-and-Bound and Transformation Decomposition

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021
Estimating the pose of a calibrated camera relative to a 3D point set from one image is an important task in computer vision. Perspective-n-Point algorithms are often used if perfect 2D-3D correspondences are known.
Chen Wang, Yinlong Liu, Yiru Wang, Xuechen Li, Manning Wang   +4 more
semanticscholar   +1 more source

Improving the filtering of Branch-And-Bound MDD solver (extended)

Integration of AI and OR Techniques in Constraint Programming, 2021
This paper presents and evaluates two pruning techniques to reinforce the efficiency of constraint optimization solvers based on multi-valued decision-diagrams (MDD). It adopts the branch-and-bound framework proposed by Bergman et al.
Xavier Gillard, Vianney Copp'e, P. Schaus, A. Ciré   +3 more
semanticscholar   +1 more source

Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm

Swarm and Evolutionary Computation, 2020
This work presents a novel parallel branch and bound algorithm to efficiently solve to optimality a set of instances of the multi-objective flexible job shop scheduling problem for the first time, to the very best of our knowledge.
Carlos Soto, Carlos Soto, B. Dorronsoro, Héctor J. Fraire, Laura Cruz-Reyes, C. Gómez-Santillán, Nelson Rangel   +6 more
semanticscholar   +1 more source

A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem

Expert systems with applications, 2020
This article is a comprehensive review of Branch-and-Bound algorithms for solving flowshop scheduling problems, from the early works of Ignall and Schrage (1965) and Brown and Lomnicki (1966) to the recent approaches of Labidi et al. (2018) and Li et al.
Caio Paziani Tomazella, M. S. Nagano
semanticscholar   +1 more source