Proceedings of the Annual Conference of the Institute of Systems, Control and Information Engineers
The 51st Annual Conference of the Institute of Systems, Control and Information Engineers
Session ID : 6T1-1
Conference information

Host: The Institute of Systems, Control and Information Engineers

Improvement method of branching operation in BMI Branch and Bound method
*Masaya Ueda, Michihiro Kawanishi, Yoshiya Shibata
Author information
Keywords: Bilinear Matrix Inequality, Branch and Bound method
CONFERENCE PROCEEDINGS FREE ACCESS

Details
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract
Branch and Bound method is one of the optimization techniques of the BMI problem. In this research, we proposed the new method about the method of dividing the area and inspected the calculation efficiency. Moreover, we implement the algorithm of parallelized Branch and Bound method by C++ language. And numerical experiments performed on Beowulf cluster system.
Content from these authors
© 2007 The Institute of Systems, Control and Information Engineers
Previous article Next article
Favorites & Alerts

Recently viewed articles
Share this page
feedback
 Top