Journal of Automation and Information Sciences
Publicado 12 números por año
ISSN Imprimir: 1064-2315
ISSN En Línea: 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
Volumen 49,
Edición 1, 2017,
pp. 41-52
DOI: 10.1615/JAutomatInfScien.v49.i1.40
SINOPSIS
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.
PALABRAS CLAVE: 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
608 Vistas de artículos
8 Descargas de artículos
Métrica
Artículos con contenido similar:
Último edicion
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