An interval-matrix branch-and-bound algorithm for bounding eigenvalues [PDF]
, 2016 We present and explore the behaviour of a branch-and-bound algorithm for calculating valid bounds on the k-th largest eigenvalue of a symmetric interval matrix.
Dimitrios Nerantzis, Claire S. Adjiman
openalex +4 more sources
Template realization of generalized branch and bound algorithm
Mathematical Modelling and Analysis, 2005 In this work we consider a template for implementation of parallel branch and bound algorithms. The main aim of this package to ease implementation of covering and combinatorial optimization methods for global optimization.
M. Baravykaite +2 more
doaj +4 more sources
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
European Journal of Operational Research, 2021 We study the Knapsack Problem with Conflicts, a generalization of the Knapsack Problem in which a set of conflicts specifies pairs of items which cannot be simultaneously selected. In this work, we propose a novel combinatorial branch-and-bound algorithm
Stefano Coniglio +2 more
semanticscholar +3 more sources
PhISCS-BnB: a fast branch and bound algorithm for the perfect tumor phylogeny reconstruction problem. [PDF]
Bioinformatics, 2020 Sadeqi Azer E +16 more
europepmc +5 more sources
Quantum speedup of branch-and-bound algorithms [PDF]
Physical Review Research, 2020 Branch-and-bound is a widely used technique for solving combinatorial optimization problems where one has access to two procedures: a branching procedure that splits a set of potential solutions into subsets, and a cost procedure that determines a lower ...
Ashley Montanaro
doaj +3 more sources
An Ellipsoidal Branch and Bound Algorithm for Global Optimization
SIAM Journal on Optimization, 2009 19 ...
Hager, William, Phan, Dzung
openaire +3 more sources
Grafting a Branch and Bound Method on a Genetic Algorithm for Balancing I / U-Shaped Assembly Lines [PDF]
Memoirs of the Scientific Sections of the Romanian Academy, 2011 This paper presents a new efficient hybrid method that combines a branch & bound technique and a genetic algorithm for solving I/U -shaped assembly lines balancing. The basic components of a branch & bound technique that operates with topological sorting
Octav Brudaru, Cristian Rotaru
doaj +1 more source
A Branch and Bound Algorithm for Agile Earth Observation Satellite Scheduling
Discrete Dynamics in Nature and Society, 2017 The agile earth observing satellite scheduling (AEOSS) problem consists of scheduling a subset of images among a set of candidates that satisfy imperative constraints and maximize a gain function.
Xiaogeng Chu, Yuning Chen, Lining Xing
doaj +2 more sources
3D-BBS: Global Localization for 3D Point Cloud Scan Matching Using Branch-and-Bound Algorithm [PDF]
IEEE International Conference on Robotics and Automation, 2023 This paper presents an accurate and fast 3D global localization method, 3D-BBS, that extends the existing branchand-bound (BnB)-based 2D scan matching (BBS) algorithm.
Koki Aoki +5 more
semanticscholar +1 more source
An exact branch-and-bound algorithm for seru scheduling problems with sequence-dependent setup time
Soft Computing - A Fusion of Foundations, Methodologies and Applications, 2023 This paper focuses on seru scheduling problems considering the sequence-dependent setup time in seru production system, which is a new-type manufacturing system originated in Japanese production practice recently that can better adapt to the fluctuate ...
Xiaohong Zhang +3 more
semanticscholar +1 more source