View of Implementation of the Traveling Salesman Problem (TSP) Algorithm in Determining the Shortest Route for Sailing Routes for Aplousing and SBNP Maintenance Activities in the Working Area of the Tanjung Perak Type A District Navigation Office

Return to Article Details Implementation of the Traveling Salesman Problem (TSP) Algorithm in Determining the Shortest Route for Sailing Routes for Aplousing and SBNP Maintenance Activities in the Working Area of the Tanjung Perak Type A District Navigation Office Download Download PDF