- Category:
- Algorithm
- Tags:
-
- File Size:
- 160kb
- Update:
- 2018-03-08
- Downloads:
- 0 Times
- Uploaded by:
- 大纲
Description: To solve the PMP problem, the K node is found in the N node, making the rest of the rest of the N-k nodes to be the shortest distance to the K node. K is a custom value. The input file is the xlsx format, the distance matrix of the N*N.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| PMPproblem.lg4 | 448512 | 2018-03-08 |
Download