Global Optima for Size Optimization Benchmarks by Branch and Bound Principles
dc.contributor.author | Pospíšilová , Adéla | |
dc.contributor.author | Lepš , Matej | |
dc.date.accessioned | 2017-02-09T07:02:00Z | |
dc.date.available | 2017-02-09T07:02:00Z | |
dc.date.issued | 2012 | |
dc.identifier.citation | Acta Polytechnica. 2012, vol. 52, no. 6. | |
dc.identifier.issn | 1210-2709 (print) | |
dc.identifier.issn | 1805-2363 (online) | |
dc.identifier.uri | http://hdl.handle.net/10467/67001 | |
dc.description.abstract | This paper searches for global optima for size optimization benchmarks utilizing a method based on branch and bound principles. The goal is to demonstrate the process for finding these global optima on the basis of two examples. A suitable parallelization strategy is used in order to minimize the computational demands. Optima found in the literature are compared with the optima used in this work. | en |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | |
dc.publisher | České vysoké učení technické v Praze | cs |
dc.publisher | Czech Technical University in Prague | en |
dc.relation.ispartofseries | Acta Polytechnica | |
dc.relation.uri | https://ojs.cvut.cz/ojs/index.php/ap/article/view/1682 | |
dc.rights | Creative Commons Attribution 4.0 International License | en |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | |
dc.subject | benchmarks | en |
dc.subject | discrete sizing optimization | en |
dc.subject | branch and bound method | en |
dc.subject | global optima | en |
dc.subject | parallel programming | en |
dc.title | Global Optima for Size Optimization Benchmarks by Branch and Bound Principles | |
dc.type | article | en |
dc.date.updated | 2017-02-09T07:02:00Z | |
dc.rights.access | openAccess | |
dc.type.status | Peer-reviewed | |
dc.type.version | publishedVersion |
Soubory tohoto záznamu
Tento záznam se objevuje v následujících kolekcích
Kromě případů, kde je uvedeno jinak, licence tohoto záznamu je Creative Commons Attribution 4.0 International License