Journal of Automation and Information Sciences
Publicou 12 edições por ano
ISSN Imprimir: 1064-2315
ISSN On-line: 2163-9337
SJR:
0.173
SNIP:
0.588
CiteScore™::
2
Indexed in
Properties of Combinatorial Optimization Unconstrained Problems on Arrangements with Linear and Linear-Fractional Objective Functions
Volume 49,
Edição 1, 2017,
pp. 41-52
DOI: 10.1615/JAutomatInfScien.v49.i1.40
RESUMO
The properties of unconstrained Euclidean problems of combinatorial optimization on arrangements with linear and linear-fractional objective functions are considered. It is shown that every extremal in linear problem is element of certain set of polyarangements. For problems with linear- fractional objective function it was substantiated the way of formation of the set of all extremals, if one of them is known.
Palavras-chave: properties of unconstrained Euclidean problems, combinatorial optimization on arrangements, linear and linear-fractional objective functions, the way of formation of the set of all extremals
CITADO POR
-
Barbolina Tetiana, Estimates of objective function minimum for solving linear fractional unconstrained combinatorial optimization problems on arrangements, Physico-mathematical modelling and informational technologies, 32, 2021. Crossref
607 Visualizações do artigo
8 downloads de artigos
Métricas
Artigos com conteúdo semelhante:
Última edição
Modeling of Configurations Formed when Using Microneedle Systems
Properties of Large Deviations of Empirical Estimates in a Stochastic Optimization Problem for a Homogeneous Random Field
The Dynamics of One Arms Race Mathematical Model with a Delay
Some Ways to Modeling Input Data for Information Search in the Library of Standards when Solving Semantics Problems
Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
Complete Asymptotics of Approximations by Certain Singular Integrals in Mathematical Modeling
Index, Volume 52, 2020