Results 11 to 20 of about 224,803 (288)
RNA secondary structure design [PDF]
, 2006 We consider the inverse-folding problem for RNA secondary structures: for a given (pseudo-knot-free) secondary structure find a sequence that has that structure as its ground state. If such a sequence exists, the structure is called designable.
A. K. Hartmann +8 more
core +2 more sources
PENERAPAN BRANCH AND BOUND ALGORITHM DALAM OPTIMALISASI PRODUKSI ROTI
E-Jurnal Matematika, 2016 Companies which engaged in production activities such as Ramadhan Bakery would want optimal profit in their every production. The aim of this study was to find optimal profit and optimal combination of bread production (original chocolate bread, extra ...
GEDE SURYAWAN +2 more
doaj +1 more source
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.
Adjiman, CSJ, Nerantzis, D
core +1 more source
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
Minimizing sum of completion times on a single machine with sequence-dependent family setup times [PDF]
, 2006 This paper presents a branch-and-bound (B&B) algorithm for minimizing the sum of completion times in a singlemachine scheduling setting with sequence-dependent family setup times.
C Akkan +4 more
core +1 more source
Acta Scientiarum: Technology, 2016 This paper has the objective to evaluate the use of different methods to obtain an initial solution for the branch and bound algorithm with the objective of minimizing the makespan in a flowshop with zero buffer environment. As the problem is known to be
Felipe Borreiro Sanches +2 more
doaj +1 more source
Optimized Data Association Based on Gaussian Mixture Model
IEEE Access, 2020 Data association is the foundation of state estimation in mobile robot simultaneous localization and mapping. Aiming at the problems of false association, high computational complexity in joint compatible branch and bound algorithm, we propose an ...
Xiaogang Ruan +3 more
doaj +1 more source
Technological and Economic Development of Economy, 2009 Many problems in economy may be formulated as global optimization problems. Most numerically promising methods for solution of multivariate unconstrained Lipschitz optimization problems of dimension greater than 2 use rectangular or simplicial branch‐and‐
Remigijus Paulavičius +1 more
doaj +1 more source
Finding and proving the optimum : cooperative stochastic and deterministic search [PDF]
, 2012 In this article, we introduce a global cooperative approach between an Interval Branch and Bound Algorithm and an Evolutionary Algorithm, that takes advantage of both methods to optimize a function for which an inclusion function can be expressed.
Alliot, Jean-Marc +3 more
core +2 more sources
Globally optimal phasor measurement unit placement using branch and bound algorithm
Ain Shams Engineering Journal, 2021 This paper presents a new global optimal Phasor Measurement Unit (PMU) placement approach based on branch and bound algorithm. The proposed technique provides the global minimum number and locations of PMUs for any power system.
Mohamed Z. Kamh +2 more
doaj +1 more source