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...
Αποθηκεύτηκε σε:
| Κύριοι συγγραφείς: | , , |
|---|---|
| Μορφή: | Άρθρο |
| Γλώσσα: | Ρωσικά |
| Έκδοση: |
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 |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|