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
Solving of Discrete Problems of Optimization with Linear-Fractional Objective Function by Branch and Bound Methods
Volumen 45,
Edición 9, 2013,
pp. 77-83
DOI: 10.1615/JAutomatInfScien.v45.i9.70
SINOPSIS
Exact combinatorial method for solving the problems of discrete optimization with linear-fractional objective function is under consideration. The algorithm of branch and bound method was constructed for solving the mentioned problem.
395 Vistas de artículos
5 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