Доступ предоставлен для: Guest
Портал Begell Электронная Бибилиотека e-Книги Журналы Справочники и Сборники статей Коллекции
Journal of Automation and Information Sciences
SJR: 0.232 SNIP: 0.464 CiteScore™: 0.27

ISSN Печать: 1064-2315
ISSN Онлайн: 2163-9337

Выпуски:
Том 52, 2020 Том 51, 2019 Том 50, 2018 Том 49, 2017 Том 48, 2016 Том 47, 2015 Том 46, 2014 Том 45, 2013 Том 44, 2012 Том 43, 2011 Том 42, 2010 Том 41, 2009 Том 40, 2008 Том 39, 2007 Том 38, 2006 Том 37, 2005 Том 36, 2004 Том 35, 2003 Том 34, 2002 Том 33, 2001 Том 32, 2000 Том 31, 1999 Том 30, 1998 Том 29, 1997 Том 28, 1996

Journal of Automation and Information Sciences

DOI: 10.1615/JAutomatInfScien.v32.i10.80
pages 59-66

On a Heuristic Procedure of Selection of a Finite Set Covering

Klara G. Sabiryanova
Institue of Mathematics and Mechanics of Ural brunch of Russian Academy of Sciences, Ekaterinburg, Russia

Краткое описание

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.