The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks
It is challenging to design large and low-cost communication networks. In this paper, we formulate this challenge as the prize-collecting Steiner Tree Problem (PCSTP). The objective is to minimize the costs of transmission routes and the disconnected monetary or informational profits. Initially, we note that the PCSTP is MAX SNP-hard. Then, we propose some post-processing techniques to improve suboptimal solutions to PCSTP. Based on these techniques, we propose two fast heuristic algorithms:...[Show more]
|Collections||ANU Research Publications|
|Source:||IEEE Transactions on Networking|
|08604004.pdf||3.19 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.