- Category:
- matlab
- Tags:
-
[Text]
- File Size:
- 1.34kb
- Update:
- 2008-10-13
- Downloads:
- 0 Times
- Uploaded by:
- wanle2000
Description: 0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source
- [5ivb_325773] - a calendar and contact management softwa
- [Anneal] - the simulated annealing source, data fil
- [fiveChet] - write the C# 331 game of the source, can
- [HungarySolution] - Hungary Solution Algorithm MATLAB progra
- [antyy] - In this paper, the theory surrounding th
- [plan] - First, the problem: a factory according
- [fenpei] - Hungarian algorithm m file is assigned t
File list (Check if you may need any files):
Download