Adaptive Panoramic Video Multicast Streaming with Limited FoV Feedback

Algorithm 1

Branch-and-bound algorithm for solving the problem.

Input: Optimal objective function value for relaxation problem; Optimal objective function value for relaxation problem; Any value in the range (0, 1);

Output: The optimal solution to problem p − 1 that meets the 0-1 constraint condition; The optimal objective function solution corresponding to the optimal 0-1 solution to problem p − 1.(1)Initialization: k = 0, L = 0, (2)choose any solution that does not meet the 0-1 constraints from , that is, .(3)ifthen(4)Add the constraint to problem p − 1 to form subproblem I.(5)else(6)add the constraint to problem p − 1 to form subproblem II.(7)end if(8)k++, continue to find the solutions to the relaxation problems in subproblems I and II (denoted as ), where the optimal objective function value is .(9)Find the maximum value of the optimal objective function as the new upper bound, that is, , (10)From the branches that meet the 0-1 condition, find the maximum value of the objective function as the new lower bound. , (11)ifthen(12)cut this branch.(13)else if and then,(14)return to step 2 and repeat.(15)else(16)the optimal solution to the then problem p − 1 has been found, that is, and (17)end if