Tree knapsack approaches for local access network design |
| |
| Affiliation: | 1. School of Computer Science, China University of Geosciences, Wuhan 430074, China;2. Institute of Computer Science, Heidelberg University, Heidelberg 69120, Germany;1. School of Information Technology, Jiangxi University of Finance and Economics, Nanchang 330013 ,Jiangxi, China;2. Department of Management Sciences, City University of Hong Kong, Tat Chee Ave, Kowloon Tong, Hong Kong;3. School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 637371, Singapore |
| |
| Abstract: | In the process of solving many forms of the local access network design problem, the basic model of the tree knapsack problem (TKP) is used as a building block for the search engine of the solution strategy. Various solution strategies can be used to solve this problem. An approach that use standard software coupled with enhanced modelling is presented for the TKP. Enhanced modelling is used to partition the TKP into sub-problems that is easier to solve using standard off the shelve software. The basic approach is described and empirical work is presented. Empirical comparisons are also given relating this approach with some algorithms suggested by other authors. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
