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 “"Multiple Salesman Traveling Salesman Problem"”.

  1. Autonomous and Semi-Autonomous Control of Multi-Agent Task Allocation Systems

    … solve a wide variety of NP-Hard task allocation problems effectively and in computation times acceptable for real-time application has motivated the development of new optimal and large scale approximation methods presented in this dissertation. The chief new optimal method presented, referred to …

    cornell Repository record for Autonomous and Semi-Autonomous Control of Multi-Agent Task Allocation Systems (opens in a new tab)