A semidefinite optimization approach to the Target Visitation Problem

摘要: We propose an exact algorithm for the Target Visitation Problem (TVP). The (TVP) is a composition of Linear Ordering and Traveling Salesman Problem. It has several military non-military applications, where two important, often competing factors are overall distance traveled (e.g. by unmanned aerial vehicle) visiting sequence various targets or points interest. Hence our can be used to find optimal pre-determined targets. First we show that special Quadratic Position Building on this finding semidefinite optimization approach tackle finally demonstrate its efficiency variety benchmark instances with up 50