\input zb-basic
\input zb-ioport
\iteman{io-port 05377937}
\itemau{Hong, Jungman; Lim, Seungkil}
\itemti{Branch and price algorithm for content allocation problem in VOD network.}
\itemso{Gervasi, Osvaldo (ed.) et al., Computational science and its applications -- ICCSA 2005. International conference, Singapore, May 9--12, 2005. Proceedings, Part IV. Berlin: Springer (ISBN 978-3-540-25863-6/pbk). Lecture Notes in Computer Science 3483, 642-651 (2005).}
\itemab
Summary: This paper considers an optimal video file allocation problem in a video-on-demand (VOD) network. The objective of the problem is to find an optimal video file allocation strategy, giving both types of videos and the number of copies of each video file type to be carried at each distributed server and each local server in the VOD network, that minimizes the associated storage and transmission cost subject to each server capacity. The problem is formulated as a mixed integer programming problem and solved by a column generation approach. Computational results show that the associated column generation algorithm with three exploited valid inequalities applied and a branch-and-bound procedure can together solve practical size problems in reasonable time.
\itemrv{~}
\itemcc{}
\itemut{}
\itemli{doi:10.1007/11424925\_68}
\end