One class of optimization problems with alternative constraints and its application.

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F05%3A00207585" target="_blank" >RIV/00216208:11320/05:00207585 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

One class of optimization problems with alternative constraints and its application.

Original language description

We consider a class of disjunctive minimization problems, the objective function of which can be expressed as the maximum of a finite number of continuous functions. The constraints of the problems consist of m disjunctive constraints. A special structure of the problems makes it possible to find a global minimum after at most mn smaller minimization subproblems had been solved. The results can be applied in location problems or machine time scheduling problems.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2005

Confidentiality

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

Article name in the collection

Proceedings KOI 2004, 3-9

ISBN

953-6931-15-X

ISSN

—

e-ISSN

—

Number of pages

7

Pages from-to

—

Publisher name

Univerzita Zagreb

Place of publication

Split

Event location

Split

Event date

Jan 1, 2005

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—