Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Close Enough Travelling Salesman Problem"”.

  1. Maximum-entropy principle approach to the multiple travelling salesman problem and related problems

    … principle as a heuristic for the multiple travelling salesman problem. This is a computationally complex problem which requires special treatment by conventional optimization techniques. Specific focus is given to developing a generalized framework for this problem that can be applied to …

    uiuc Repository record for Maximum-entropy principle approach to the multiple travelling salesman problem and related problems (opens in a new tab)