Improving the efficiency of branch-and-bound complete-search NMR assignment using the symmetry of molecules and spectra

2015 ◽  
Vol 142 (7) ◽  
pp. 074103 ◽  
Author(s):  
Andrés Bernal ◽  
Andrés M. Castillo ◽  
Fabio González ◽  
Luc Patiny ◽  
Julien Wist
Keyword(s):  
Branch And Bound ◽  
Nmr Assignment ◽  
Complete Search ◽  
Symmetry Of Molecules

scholarly journals Reconsidering complete search algorithms for protein backbone NMR assignment

2005 ◽  
Vol 21 (Suppl 2) ◽  
pp. ii230-ii236 ◽  
Author(s):  
O. Vitek ◽  
C. Bailey-Kellogg ◽  
B. Craig ◽  
P. Kuliniewicz ◽  
J. Vitek
Keyword(s):  
Nmr Assignment ◽  
Search Algorithms ◽  
Protein Backbone ◽  
Complete Search

scholarly journals Interval Tests and Contractors Based on Optimality Conditions for Bound-Constrained Global Optimization

2020 ◽  
Vol 29 (03n04) ◽  
pp. 2060001
Author(s):  
Laurent Granvilliers
Keyword(s):  
Experimental Study ◽  
Optimality Conditions ◽  
Branch And Bound ◽  
Global Optimum ◽  
Constrained Global Optimization ◽  
First Order ◽  
Branch And Bound Algorithms ◽  
Complete Search ◽  
Monotonicity Test ◽  
Interval Branch And Bound

We study the problem of finding the global optimum of a nonlinear real function over an interval box by means of complete search techniques, namely interval branch-and-bound algorithms. Such an algorithm typically generates a tree of boxes from the initial box by alternating branching steps and contraction steps in order to remove non optimal sub-boxes. In this paper, we introduce a new contraction method that is designed to handle the boundary of the initial box where a minimizer may not be a stationary point. This method exploits the first-order optimality conditions and we show that it subsumes the classical monotonicity test based on interval arithmetic. A new branch-and-bound algorithm has been implemented in the interval solver Realpaver. An extensive experimental study based on a set of standard benchmarks is presented.

PENJADWALAN OPTIMAL TIPE PRODUKSI FLOWSHOP DUA TAHAP MENGGUNAKAN METODE BRANCH AND BOUND DENGAN MEMPERHATIKAN WAKTU TRANSPORTASI

2017 ◽  
Vol 2 (1) ◽  
pp. 1-8
Author(s):  
Marie Muhammad ◽  
Elis Ratna Wulan
Keyword(s):  
Branch And Bound

Penjadwalan produksi dapat dibagi menjadi dua jenis, yaitu penjadwalan produksi tipe jobshop dan penjadwalan produksi tipe flowshop. Penjadwalan produksi tipe flowshop adalah sebuah penjadwalan sebuah produk yang sedemikian rupa sehingga setiap produk diproduksi melalui mesin yang sama dengan alur produksi yang sama. Terdapat beberapa masalah flowshop, salah satunya adalah dengan memperhatikan waktu transportasi. Dan metode Branch and Bound adalah solusi yang tepat untuk memecahkan masalah penjadwalan produksi dengan memperhatikan waktu transportasi untuk meminimalisir waktu yang terlewati. Pada penulisan Studi Literatur ini, Penjadwalan optimal dari 4 buah job dan 2 buah mesin dengan memperhatikan waktu transportasi adalah 1, 2, 4, dan 3 dengan waktu yang terlewati adalah 59 unit satuan waktu.

Unit Commitment Solution by Branch and Bound Algorithm

2020 ◽  
Author(s):  
Bishaljit Paul ◽  
Sushovan Goswami ◽  
Dipu Mistry ◽  
Chandan Kumar Chanda
Keyword(s):  
Branch And Bound ◽  
Unit Commitment ◽  
Branch And Bound Algorithm
Sign in / Sign up

Export Citation Format

Share Document