A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem

DOI10.1016/J.EJOR.2006.07.031zbMath1128.90009OpenAlexW1971581721MaRDI QIDQ879323

Iradj Ouveysi, Osman Oguz, Tolga Bektaş

Publication date: 11 May 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/23371

zbMATH Keywords

integer programmingdecompositionroutingvideo on demandlagrangean relaxationplacement

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Decomposition methods (49M27)

Cites Work

• Unnamed Item
• Unnamed Item
• Load balancing for clusters of VOD servers
• Optimum and multicast of multimedia streams
• An incentive charging scheme for video-on-demand
• Validation of subgradient optimization

This page was built for publication: A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem