Journal
OPTIMIZATION LETTERS
Volume 4, Issue 2, Pages 173-183Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-009-0156-3
Keywords
Global optimization; Branch and bound; Selection strategies; Lipschitz optimization; Parallel branch and bound
Funding
- European Community [RII3-CT-2003-506079]
- Lithuanian State Science and Studies Foundation [B-03/2007]
Ask authors/readers for more resources
Speed and memory requirements of branch and bound algorithms depend on the selection strategy of which candidate node to process next. The goal of this paper is to experimentally investigate this influence to the performance of sequential and parallel branch and bound algorithms. The experiments have been performed solving a number of multidimensional test problems for global optimization. Branch and bound algorithm using simplicial partitions and combination of Lipschitz bounds has been investigated. Similar results may be expected for other branch and bound algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available