View in EDS HTML Full Text PDF Full Text

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

Saved in:
Bibliographic Details
Title: Results for the close-enough traveling salesman problem with a branch-and-bound algorithm.
Authors: Zhang, Wenda1, zwd.kid@gmail.com, Sauppe, Jason J.2, Jacobson, Sheldon H.3
Source: Computational Optimization & Applications; Jun2023, Vol. 85 Issue 2, p369-407, 39p
Database: Applied Science & Technology Source
Full text is not displayed to guests.
Description
ISSN:09266003
DOI:10.1007/s10589-023-00474-3