Results 1 to 10 of about 115,593 (263)
A General Scheme of a Branch-and-Bound Approach for the Sensor Selection Problem in Near-Field Broadband Beamforming [PDF]
SensorsThis paper is devoted to the sensor selection problem. A broadband receiver beamforming working in a near-field is considered. The system response should be as close as possible to the desired one, which is optimized in the sense of L2 norm.
Agnieszka Wielgus, Bogusław Szlachetko
doaj +2 more sources
A Branch-and-Bound approach for tautomer enumeration [PDF]
Journal of Cheminformatics, 2010 Thalheim Torsten +3 more
doaj +2 more sources
Compressing branch-and-bound trees
Mathematical Programming, 2023 A short version of this article was accepted for publication at IPCO 2023. This extended version contains more detailed discussions and proofs, and new computational contributions and ...
Gonzalo Muñoz 0001 +2 more
openaire +3 more sources
Tool for Simulating Branch and Bound Computations
Open Computer Science, 2020 The paper describes a simulator of parallel Branch and Bound (BnB) method. Several subdomain trees for benchmark functions are analyzed, a characteristic Gaussian-like distribution is discovered.
Ignatov Andrei, Gorchakov Andrei
doaj +1 more source
Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment [PDF]
Компьютерные исследования и моделирование, 2015 The paper presents an implementation of branch and bound algorithm employing coarse grained parallelism. The system is based on CBC (COIN-OR branch and cut) open-source MIP solver and inter-process communication capabilities of Erlang.
S. A. Smirnov, V. V. Voloshinov
doaj +1 more source
Spektrum Industri: Jurnal Ilmiah Pengetahuan dan Penerapan Teknik Industri, 2020 GNP Snack company has problems in making raw material inventories which are sometimes not enough for 0.5 tons of cassava chips to fulfill demand. This will affect the production process carried out every day.
Sarif Hasan, Yohanes Anton Nugroho
doaj +1 more source
Branch and bound on the network model [PDF]
Theoretical Computer Science, 1995 Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal speedup within a constant factor (for \(p< n/(\log n)^{c}\), where \(p\) is the number of processors, \(n\) is the ``size'' of the problem, and \(c\) is a constant). Ranade later
openaire +1 more source
A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers
Mathematics, 2022 In the game industry, tardiness is an important issue. Unlike a unifunctional machine, a developer may excel in programming but be mediocre in scene modeling. His/her processing speed varies with job type. To minimize tardiness, we need to schedule these
Chung-Ho Su, Jen-Ya Wang
doaj +1 more source
The temolate for parallel branch algorithm
Lietuvos Matematikos Rinkinys, 2004 The aim of this work is to propose parallel branch and bound algorithm template. For this purpose sequential template is introduced. Implementing additional features of this template some parallel branch and bound algorithms are comstructed and analyzed
Milda Baravykaitė
doaj +3 more sources
Introducing an Educational Tool for Learning Branch & Bound Strategy
Journal of Information Systems Engineering and Business Intelligence, 2017 —According to our informal survey, Branch & Bound strategy is considerably difficult to learn compared to other strategies. This strategy consists of several complex algorithmic steps such as Reduced Cost Matrix (RCM) calculation and Breadth First Search.
Sofriesilero Zumaytis, Oscar Karnalim
doaj +1 more source