Laddar…
Academic Journal
IMPLEMENTATION The branch and bound method for solving The traveling salesman problem with sparse matrix
M. P. Revotjuk, M. K. Qaraleh, P. M. Batura
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, Vol 0, Iss 7, Pp 25-31 (2019)
Sparad:
| Titel | IMPLEMENTATION The branch and bound method for solving The traveling salesman problem with sparse matrix |
|---|---|
| Författarna | M. P. Revotjuk, M. K. Qaraleh, P. M. Batura |
| Utgivningsår |
2019
|
| Källa |
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, Vol 0, Iss 7, Pp 25-31 (2019)
|
| Beskrivning |
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 of the new solution on branch’s tree path. The reoptimization algorithm, based on a Shortest Augmenting Path method, is offered.
|
| Dokumenttyp |
article
|
| Språk |
Russian
|
| Information om utgivare |
Educational institution «Belarusian State University of Informatics and Radioelectronics», 2019.
|
| Ämnestermer | |
