【摘 要】
:
In the Covering Salesman Problem (CSP), a distribution of nodes is provided, and the objective is to identify the shortest-length tour of a subset of all given
【机 构】
:
DepartmentofComputer&,InformationEngineering,DepartmentofElectricalandElectronicEngineering