An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints

Abstract

Semantic Scholar extracted view of "An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints" by Minh Hoang Ha et al.

Topics

0 Figures and Tables

    Download Full PDF Version (Non-Commercial Use)