000009259 001__ 9259
000009259 005__ 20141204092423.0
000009259 04107 $$aeng
000009259 046__ $$k12/05/2014
000009259 100__ $$aPospíšilová, A.
000009259 24500 $$aBranch and bound method for global optima of size optimization benchmarks

000009259 24630 $$n18.$$pEngineering Mechanics 2012
000009259 260__ $$bInstitute of Theoretical and Applied Mechanics, AS CR, Prague
000009259 506__ $$arestricted
000009259 520__ $$2eng$$aThis contribution focuses on searching for global optima of size optimization benchmarks utilizing a method based on branch and bound principles. The goal is to show the process of finding these global optima on several examples. To minimize computational demands a suitable parallelization is used. Optima which can be found in available literature and optima obtained in this work are compared.

000009259 540__ $$aText je chráněný podle autorského zákona č. 121/2000 Sb.
000009259 653__ $$abenchmarks, discrete sizing optimization, branch and bound method, global optima, parallel programming

000009259 7112_ $$aEngineering Mechanics 2012$$cSvratka (CZ)$$d12/05/2014 - 15/05/2014$$gEM2012
000009259 720__ $$aPospíšilová, A.$$iLepš, M.
000009259 8560_ $$ffischerc@itam.cas.cz
000009259 8564_ $$s341942$$uhttps://invenio.itam.cas.cz/record/9259/files/230_Pospisilova_A-FT.pdf$$yOriginal version of the author's contribution as presented on CD, paper (No. 230).
000009259 962__ $$r8924
000009259 980__ $$aPAPER