Global Optima for Size Optimization Benchmarks by Branch and Bound Principles

Authors

  • Adéla Pospíšilová
  • Matej Lepš

DOI:

https://doi.org/10.14311/1682

Keywords:

benchmarks, discrete sizing optimization, branch and bound method, global optima, parallel programming

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.

Downloads

Author Biographies

  • Adéla Pospíšilová
  • Matej Lepš

Downloads

Published

2012-01-06

Issue

Section

Articles

How to Cite

Pospíšilová, A., & Lepš, M. (2012). Global Optima for Size Optimization Benchmarks by Branch and Bound Principles. Acta Polytechnica, 52(6). https://doi.org/10.14311/1682