Отрывок: To solve the problem, it is necessary to find a Hamiltonian cycle with a minimum weight. The branch and bound method in this problem uses the edge of the graph as the dividing element and the sum of the edge weights as the estimate. Note that the adjacency matrix of the original graph is used for convenience of analysis. Previously, the authors conducted statistical studies [8] for three differen...
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Abramyan, M.E. | - |
dc.contributor.author | Melnikov, B.F. | - |
dc.contributor.author | Nichiporchuk, A.V. | - |
dc.contributor.author | Trenina, M.A. | - |
dc.date.accessioned | 2020-08-06 11:00:23 | - |
dc.date.available | 2020-08-06 11:00:23 | - |
dc.date.issued | 2020 | - |
dc.identifier | Dspace\SGAU\20200805\85083 | ru |
dc.identifier.citation | Abramyan M.E. Application of artificial intelligence in the branch and bound method on the example of various applied problems / M.E. Abramyan, B.F. Melnikov, A.V. Nichiporchuk, M.A. Trenina // Информационные технологии и нанотехнологии (ИТНТ-2020). Сборник трудов по материалам VI Международной конференции и молодежной школы (г. Самара, 26-29 мая): в 4 т. / Самар. нац.-исслед. ун-т им. С. П. Королева (Самар. ун-т), Ин-т систем. обраб. изобр. РАН-фил. ФНИЦ "Кристаллография и фотоника" РАН; [под ред. В. А. Фурсова]. – Самара: Изд-во Самар. ун-та, 2020. – Том 4. Науки о данных. – 2020. – С. 922-925. | ru |
dc.identifier.uri | http://repo.ssau.ru/handle/Informacionnye-tehnologii-i-nanotehnologii/Application-of-artificial-intelligence-in-the-branch-and-bound-method-on-the-example-of-various-applied-problems-85083 | - |
dc.description.abstract | The article describes the possible approaches to the use of artificial intelligence to improve the work of the branch and bound method in various applied problems. Various developments obtained by the authors earlier in the study of the branch and bound method are used, as well as new solutions to the problems are considered. | ru |
dc.language.iso | en | ru |
dc.title | Application of artificial intelligence in the branch and bound method on the example of various applied problems | ru |
dc.type | Article | ru |
dc.textpart | To solve the problem, it is necessary to find a Hamiltonian cycle with a minimum weight. The branch and bound method in this problem uses the edge of the graph as the dividing element and the sum of the edge weights as the estimate. Note that the adjacency matrix of the original graph is used for convenience of analysis. Previously, the authors conducted statistical studies [8] for three differen... | - |
Располагается в коллекциях: | Информационные технологии и нанотехнологии |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
ИТНТ-2020_том 4-922-925.pdf | 405.16 kB | Adobe PDF | Просмотреть/Открыть |
Показать базовое описание ресурса
Просмотр статистики
Поделиться:
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.