Show simple item record

dc.contributor.authorBektaş, T.en_US
dc.contributor.authorOǧuz, O.en_US
dc.contributor.authorOuveysi, I.en_US
dc.date.accessioned2016-02-08T10:20:24Z
dc.date.available2016-02-08T10:20:24Z
dc.date.issued2006en_US
dc.identifier.issn1089-7798
dc.identifier.urihttp://hdl.handle.net/11693/23863
dc.description.abstractIn this paper, we propose a novel optimization algorithm for the solution of the video placement and routing problem based on Lagrangean relaxation and decomposition. The main contribution can be stated as the use of integer programming models to obtain feasible solutions to the problem within the algorithm. Computational experimentation reveals that the use of such integer models help greatly in obtaining good quality solutions in a small amount of solution time.en_US
dc.language.isoEnglishen_US
dc.source.titleIEEE Communications Lettersen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/LCOMM.2006.02007en_US
dc.subjectVideo-on-demanden_US
dc.subjectPlacementen_US
dc.subjectRoutingen_US
dc.subjectInteger programmingen_US
dc.subjectLagrangean relaxationen_US
dc.subjectDecompositionen_US
dc.titleA novel optimization algorithm for video placement and routingen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage114en_US
dc.citation.epage116en_US
dc.citation.volumeNumber10en_US
dc.citation.issueNumber2en_US
dc.identifier.doi10.1109/LCOMM.2006.02007en_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.identifier.eissn1558-2558


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record