IMPLEMENTATION The branch and bound method for solving The traveling salesman problem with sparse matrix
The problem of the solution of asymmetric traveling salesman problem with sparse matrix, based on branch and bound techniques with linear assignment problems relaxation, is considered. Inheritance of the result’s data of previous problems and its reoptimization allows to decreasing time of reception...
Сохранить в:
| Главные авторы: | M. P. Revotjuk, M. K. Qaraleh, P. M. Batura |
|---|---|
| Формат: | Статья |
| Язык: | русский |
| Опубликовано: |
Educational institution «Belarusian State University of Informatics and Radioelectronics»
2019-06-01
|
| Серии: | Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki |
| Предметы: | |
| Online-ссылка: | https://doklady.bsuir.by/jour/article/view/234 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
Схожие документы
-
Quick eVALUATION OF THE INTERVAL STABILITY OF THE LINEAR ASSIGNMENT problem SOLUTIONS
по: M. P. Revotjuk, и др.
Опубликовано: (2019-06-01) -
QUICK SEARCH OF The shortest paths on the graph WITH A PREDETERMINED DECISION
по: M. P. Revotjuk, и др.
Опубликовано: (2019-06-01) -
ALGORITHM FOR SOLVING EXTREME SCHEDULING PROBLEMS
по: Gennady A. Berketov
Опубликовано: (2016-08-01) -
Efficiency comparison of exact and approximate algorithms for solving set covering problem
по: Igor S. Konovalov, и др.
Опубликовано: (2017-10-01) -
Планирование траектории полета БПЛА при мониторинге большой области
по: Alexey Rodionov, и др.
Опубликовано: (2025-06-01)