Results 261 to 270 of about 178,189 (288)
Some of the next articles are maybe not open access.
Tolerance-based Branch and Bound algorithms for the ATSP
European Journal of Operational Research, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turkensteen, M. +3 more
openaire +3 more sources
Parallel Algorithm Design for Branch and Bound
2006Large and/or computationally expensive optimization problems sometimes require parallel or high-performance computing systems to achieve reasonable running times. This chapter gives an introduction to parallel computing for those familiar with serial optimization.
David A. Bader +2 more
openaire +1 more source
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
Algorithms based on branch and bound for the flying sidekick traveling salesman problem
Omega, 2021Mauro Dell'Amico +2 more
exaly
Fast branch & bound algorithms for optimal feature selection
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004Petr Somol, Pavel Pudil
exaly