Search
Now showing items 1-1 of 1
OPTIMASI RUTE MULTIPLE-TRAVELLING SALESMAN PROBLEM MELALUI PEMROGRAMAN INTEGER DENGAN METODE BRANCH AND BOUND
(2013-06-20)
This article aims to find the optimal route of Multiple-Traveling Salesman Problem (m-TSP) on integer programming with Branch and Bound method. In this article, two major steps undertaken to formulate an integer programming ...