Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm

Aleksandr N. Maksimenko

Modeling and Analysis of Information Systems
Modelirovanie i analiz informacionnyh sistem

ISSN 1818-1015 (Print)
ISSN 2313-5417 (Online)

User

eng | рус

Modeling and Analysis of Information Systems

Advanced search

Archives

Download this PDF file

Fullscreen

For citations:

Maksimenko A.N. Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm. Modeling and Analysis of Information Systems. 2020;27(1):72-85. (In Russ.) https://doi.org/10.18255/1818-1015-2020-1-72-85

This work is licensed under a Creative Commons Attribution 4.0 License.

ISSN 1818-1015 (Print)
ISSN 2313-5417 (Online)

Username
Password
	Remember me
Not a user? Register with this site Forgot your password?

User

Modeling and Analysis of Information Systems

For citations:

Cookies policy