• Results for the close-enough t...

Treffer: Results for the close-enough traveling salesman problem with a branch-and-bound algorithm

Title:
Results for the close-enough traveling salesman problem with a branch-and-bound algorithm
Authors:
Zhang, WendaAff1, IDs10589023004743_cor1, Sauppe, Jason J., Jacobson, Sheldon H.
Source:
Computational Optimization and Applications: An International Journal. 85(2):369-407
Database:
Springer Nature Journals