Constrained maximum weighted bipartite matching: a novel approach to radio broadcast scheduling
Science China Information Sciences, pp. 1-14, 2019.
radio broadcast scheduling branch-and-bound algorithm constrained maximum weighted bipartite matching Kuhn-Munkres algorithm strategy combinations
Given a set of radio broadcast programs, the radio broadcast scheduling problem is to allocate a set of devices to transmit the programs to achieve the optimal sound quality. In this article, we propose a complete algorithm to solve the problem, which is based on a branch-and-bound (BnB) algorithm. We formulate the problem with a new mode...More
Full Text (Upload PDF)
PPT (Upload PPT)