Transactions of the Institute of Systems, Control and Information Engineers
Online ISSN : 2185-811X
Print ISSN : 1342-5668
ISSN-L : 1342-5668
Parallel Branch and Bound Method Based on Dynamic Task Stealing for Non-convex Programming Problems
Eiki YAMAKAWA, Masafumi KAWAMOTO
Author information
Keywords: branch and bound, parallel computing, load balancing, global optimization, non-convex programming
JOURNAL FREE ACCESS

2008 Volume 21 Issue 3 Pages 100-102

Details
Download PDF (621K)
Download citation RIS

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

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Article 1st page
Content from these authors
© The Institute of Systems, Control and Information Engineers
Previous article
Favorites & Alerts

Recently viewed articles
Share this page
feedback
 Top