Parallel Random Search Algorithm

저자
by Lev Kazakovtsev
출판사
LAP Lambert Academic
출판일
20160706
ISBN
9783843317214
ISBN 등록 지역
독일어권 (ISBN 978-3)

소개

Random search methods are implemented to solve the wide variety of the large-scale discrete optimization problems when the implementation of the exact solution approaches is impossible due to large computational demands. Initially designed for unconstrained optimization, the variant probabilities method allows us to find the approximate solution of pseudo-Boolean optimization problems with constraints.