Zobrazit minimální záznam

Global Optima for Size Optimization Benchmarks by Branch and Bound Principles



dc.contributor.authorPospíšilová , Adéla
dc.contributor.authorLepš , Matej
dc.date.accessioned2017-02-09T07:02:00Z
dc.date.available2017-02-09T07:02:00Z
dc.date.issued2012
dc.identifier.citationActa Polytechnica. 2012, vol. 52, no. 6.
dc.identifier.issn1210-2709 (print)
dc.identifier.issn1805-2363 (online)
dc.identifier.urihttp://hdl.handle.net/10467/67001
dc.description.abstractThis 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.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherČeské vysoké učení technické v Prazecs
dc.publisherCzech Technical University in Pragueen
dc.relation.ispartofseriesActa Polytechnica
dc.relation.urihttps://ojs.cvut.cz/ojs/index.php/ap/article/view/1682
dc.rightsCreative Commons Attribution 4.0 International Licenseen
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.subjectbenchmarksen
dc.subjectdiscrete sizing optimizationen
dc.subjectbranch and bound methoden
dc.subjectglobal optimaen
dc.subjectparallel programmingen
dc.titleGlobal Optima for Size Optimization Benchmarks by Branch and Bound Principles
dc.typearticleen
dc.date.updated2017-02-09T07:02:00Z
dc.rights.accessopenAccess
dc.type.statusPeer-reviewed
dc.type.versionpublishedVersion


Soubory tohoto záznamu

Název:
1682-1514-1-PB.pdf
Velikost:
495.4Kb
Formát:
PDF
Zobrazit/otevřít
Název:
license.txt
Velikost:
1.707Kb
Formát:
Textový soubor
Zobrazit/otevřít

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam

Creative Commons Attribution 4.0 International License
Kromě případů, kde je uvedeno jinak, licence tohoto záznamu je Creative Commons Attribution 4.0 International License