Results 331 to 340 of about 244,573 (375)

Tolerance-based Branch and Bound algorithms for the ATSP

European Journal of Operational Research, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turkensteen, M., Ghosh, Diptesh, Goldengorin, B., Sierksma, G.   +3 more
openaire   +3 more sources

A resource flow-based branch-and-bound algorithm to solve fuzzy stochastic resource-constrained project scheduling problem

Soft Computing - A Fusion of Foundations, Methodologies and Applications, 2021
Yaghoub Alipouri
semanticscholar   +1 more source

Parallel Algorithm Design for Branch and Bound

2006
Large 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, William E. Hart, Cynthia A. Phillips   +2 more
openaire   +1 more source

Branch-and-Bound Algorithms for the Test Cover Problem

2002
In 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., Lageweg, B.J., Lenstra, J.K., Orlin, J.B., Stougie, L.   +4 more
openaire   +2 more sources

Automated Search for Block Cipher Differentials: A GPU-Accelerated Branch-and-Bound Algorithm

Australasian Conference on Information Security and Privacy, 2020
Wei-Zhu Yeoh, J. Teh, Jiageng Chen
semanticscholar   +1 more source

Evaluation of a Branch and Bound Algorithm for Clustering

SIAM Journal on Scientific and Statistical Computing, 1985
From 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), 2023
Wei-Hao Huang, Hiromichi Matsuyama, Kohji Nishimura, Yu Yamashiro   +3 more
openaire   +1 more source

Output-Space Outer Approximation Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programs

Journal of Optimization Theory and Applications
Bo Zhang, Hongyu Wang, Yue-hua Gao
semanticscholar   +1 more source

A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph

INFORMS journal on computing, 2017
A. Bettinelli, Valentina Cacchiani, E. Malaguti   +2 more
semanticscholar   +1 more source

A fast branch, bound and remember algorithm for disassembly line balancing problem

International Journal of Production Research, 2020
Zixiang Li, Zeynel Abidin Cil, Süleyman Mete   +2 more
exaly