Global Optima for Size Optimization Benchmarks by Branch and Bound Principles

Global Optima for Size Optimization Benchmarks by Branch and Bound Principles

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 co...

Full description

Bibliographic Details
Main Authors: Adéla Pospíšilová, Matej Lepš
Format: Article
Language:English
Published: CTU Central Library 2012-01-01
Series:Acta Polytechnica
Subjects:
benchmarks
discrete sizing optimization
branch and bound method
global optima
parallel programming
Online Access:https://ojs.cvut.cz/ojs/index.php/ap/article/view/1682

Internet

https://ojs.cvut.cz/ojs/index.php/ap/article/view/1682

Similar Items