Abonnement à la biblothèque: Guest
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
Get accessGet access

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.

Portail numérique Bibliothèque numérique eBooks Revues Références et comptes rendus Collections Prix et politiques d'abonnement Begell House Contactez-nous Language English 中文 Русский Português German French Spain