Journal of Automation and Information Sciences
Publication de 12 numéros par an
ISSN Imprimer: 1064-2315
ISSN En ligne: 2163-9337
SJR:
0.173
SNIP:
0.588
CiteScore™::
2
Indexed in
On a Heuristic Procedure of Selection of a Finite Set Covering
Volume 32,
Numéro 10, 2000,
pp. 59-66
DOI: 10.1615/JAutomatInfScien.v32.i10.80
RÉSUMÉ
A monotone stepwise procedure for approximate solution of additive task assignement problem with possible coincidence of some of them is suggested. Such a formulation arises, in particular, under investigation of several travelling salesmen problem, for which at the "assigning" level the optimization in the class of coverings may give a better result than in the class of partitions. Numerical results are presented.
264 Vues d'articles
1 Téléchargements d'articles
Métrique
Articles avec un contenu similaire:
Dernier numéro
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