Results 261 to 270 of about 224,803 (288)
Some of the next articles are maybe not open access.
Branch-and-Bound Algorithms for the Test Cover Problem
2002In the test cover problem a set of items is given together with a collection of subsets of the items, called tests. A smallest subcollection of tests is to be selected such that for every pair of items there is a test in the selection that contains exactly one of the two items. This problem is NP-hard in general.
de Bontridder, K.M.J. +4 more
openaire +2 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
Quantum Relaxation Based Branch-and-Bound Algorithm
2023 IEEE International Conference on Quantum Computing and Engineering (QCE), 2023Wei-Hao Huang +3 more
openaire +1 more source
Dual bounding procedures lead to convergent Branch–and–Bound algorithms
Mathematical Programming, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
A fast branch, bound and remember algorithm for disassembly line balancing problem
International Journal of Production Research, 2020Zixiang Li +2 more
exaly
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
European Journal of Operational Research, 2021Stefano Coniglio +2 more
exaly
The spherical search algorithm for bound-constrained global optimization problems
Applied Soft Computing Journal, 2019Abhishek Kumar, Swagatam Das
exaly