APA (7th ed.) Citation

Maksimenko, A. N. Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm. Yaroslavl State University.

Chicago Style (17th ed.) Citation

Maksimenko, Aleksandr N. Branch and Bound Algorithm for the Traveling Salesman Problem Is Not a Direct Type Algorithm. Yaroslavl State University.

MLA (9th ed.) Citation

Maksimenko, Aleksandr N. Branch and Bound Algorithm for the Traveling Salesman Problem Is Not a Direct Type Algorithm. Yaroslavl State University.

Warning: These citations may not always be 100% accurate.