The Close Enough Traveling Salesman Problem: A Discussion of Several Heuristics

Authors:

Publisher website

1 January 2006

book chapter
Published by Springer Nature

p. 271-283
DOI:10.1007/978-0-387-39934-8_16

Abstract

No abstract available

Keywords

This publication has 1 reference indexed in Scilit:

Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Operations Research, 1987