Heuristics for the Minimum-Weight Perfect Matching Problem on a Plane
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 105 === In this thesis, we provide some heuristic algorithms for minimum-weight perfect matching problem on a plane. First, we provide a local search algorithm based on triangle inequality. Then we try many methods to improve this algorithm. Finally we get some good al...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/yzy98q |