Abstract: The Traveling Salesman Problem (TSP) is a combinatorial optimization problem that is useful in a number of applications. Since there is no known polynomial-time algorithm for solving large ...
Abstract: The selection of slot and room in the process of improving timetable solution plays an important role in ensuring a good quality of timetable can be produced in a shorter time. A good ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results