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...
Kaydedildi:
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Russo |
| Baskı/Yayın Bilgisi: |
Educational institution «Belarusian State University of Informatics and Radioelectronics»
2019-06-01
|
| Seri Bilgileri: | Доклады Белорусского государственного университета информатики и радиоэлектроники |
| Konular: | |
| Online Erişim: | https://doklady.bsuir.by/jour/article/view/234 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|