No self-introduction
Loading
Profile
Follow
codes (2)
Cplex_programm_Tsp
4.3
The travelling salesman problem ( TSP ) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization
sarah763429 5 0
1
Establishing a College Timetable
no vote
Mr. Miller was in charge of setting up weekly schedules in two classes at a university last year. The two classes have the same teachers, except for math and PE. In college, all courses last two hours. In addition, all students in the same class take exactly the same course. From Monday to Friday, slot courses are as follows: 8:00-10:00, 10:15-12:15, 14:00-16:00, 16:15-18:15. The following table lists the number of two-hour courses per teacher, who must teach two classes per week.
sarah763429 0 0
1
No more~
Follows0
Fans0