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.

Filename	Size	Update
PMPproblem.lg4	448512	2018-03-08

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．