Global Optima for Size Optimization Benchmarks by Branch and Bound Principles

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21110%2F12%3A00199717" target="_blank" >RIV/68407700:21110/12:00199717 - isvavai.cz</a>

Result on the web

<a href="http://ctn.cvut.cz/ap/download.php?id=756" target="_blank" >http://ctn.cvut.cz/ap/download.php?id=756</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Global Optima for Size Optimization Benchmarks by Branch and Bound Principles

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

<a href="/en/project/GAP105%2F12%2F1146" target="_blank" >GAP105/12/1146: Methods for paralelization of engineering problems using low-cost technologies</a><br>

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2012

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Acta Polytechnica

ISSN

1210-2709

e-ISSN

—

Volume of the periodical

52

Issue of the periodical within the volume

6

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

8

Pages from-to

74-81

UT code for WoS article

—

EID of the result in the Scopus database

—