The anti-k-centrum location problem on a path
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 106 === In this thesis, we plan to find a facility placed on the edge of a given path, which meets the demand constraints of anti-k-centrum location problem. We provide two algorithms to solve the problem. The first algorithm uses k-level algorithm helping us, the time...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/ef3s6k |