One class of separable optimization problems: solution method, application
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10033235" target="_blank" >RIV/00216208:11320/10:10033235 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
One class of separable optimization problems: solution method, application
Original language description
A solution method for solving optimization problems with a max-separable objective function and min-separable inequality constraints is suggested. The method is based on the results of [5], [6]. Application in some location problems and small illustrative numerical examples are presented.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Optimization
ISSN
0233-1934
e-ISSN
—
Volume of the periodical
59
Issue of the periodical within the volume
5
Country of publishing house
GB - UNITED KINGDOM
Number of pages
7
Pages from-to
—
UT code for WoS article
000278857400001
EID of the result in the Scopus database
—