Referenced Items are not available for this document.
Efficiency of parallel branch and bound algorithms depends on the selection strategy. The influence to the performance of parallel MPI branch and bound algorithm with simplicial partitions and aggregate Lipschitz bound using different selection strategy is evaluated experimentally. The experiments have been performed solving a number of multidimensional test problems for global optimization.
Published in:
Cluster Computing Workshops and Posters (CLUSTER WORKSHOPS), 2010 IEEE International Conference on
Date of Conference: 20-24 Sept. 2010
- Page(s):
- 1 - 6
- E-ISBN :
- 978-1-4244-8397-6
- Print ISBN:
- 978-1-4244-8395-2
- INSPEC Accession Number:
- 11623602
- Conference Location :
- Heraklion, Crete
- Digital Object Identifier :
- 10.1109/CLUSTERWKSP.2010.5613103
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
