مشکل طراحی شبکه پوشش خدمات برای برنامه های کاربردی اینترنت تعاملی

We provide an Integer Programming formulation of this problem, and prove that it is NP-HardNP-Hard. In an attempt to solve the problem within strict computational time requirements of actual applications, we develop a solution framework based on partitioning and enumerating the solution space into smaller subproblems, one or more of which contains an optimal solution. In this framework, we develop and test an optimal seeking exact, and a fast polynomial time heuristic algorithm with success. The exact algorithm sets optimally solvable sizes of the subject problem, whereas the heuristic algorithm sets the size of solvable instances in a real application.