A Branch-and-Bound Algorithm for the Close-Enough Traveling...

INFORMS Journal on Computing 2016 / 11 Vol. 28; Iss. 4

A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem

Coutinho, Walton Pereira, Nascimento, Roberto Quirino do, Pessoa, Artur Alves, Subramanian, Anand
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
28
Language:
english
Journal:
INFORMS Journal on Computing
DOI:
10.1287/ijoc.2016.0711
Date:
November, 2016
File:
PDF, 11.90 MB
english, 2016
Conversion to is in progress
Conversion to is failed