DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sung, Chang Sup | ko |
dc.date.accessioned | 2013-02-28T06:59:58Z | - |
dc.date.available | 2013-02-28T06:59:58Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1999-11 | - |
dc.identifier.citation | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.50, no.11, pp.1168 - 1175 | - |
dc.identifier.issn | 0160-5682 | - |
dc.identifier.uri | http://hdl.handle.net/10203/73383 | - |
dc.description.abstract | This paper considers a multicast routing problem to find the minimum cost tree where the whole communication link delay on each path(route) of the tree is subject to a given delay allowance. The problem is formulated as an integer programming problem by using path variables. An associated problem reduction property is then characterised to reduce the solution space. Moreover, a polynomial time column generation procedure is exploited to solve the associated linear programming relaxation with such solution space reduced. Therefore a branch-and-price algorithm is derived to obtain the optimal integer solution(tree) for the problem. Computational results show that the algorithm can solve practical size problems in a reasonable length of time. | - |
dc.language | English | - |
dc.publisher | Palgrave Macmillan Ltd | - |
dc.subject | NETWORKS | - |
dc.subject | DELAY | - |
dc.subject | COMMUNICATION | - |
dc.title | Branch-and-Price Algorithm for a Multicast Routing Problem | - |
dc.type | Article | - |
dc.identifier.wosid | 000083559200010 | - |
dc.identifier.scopusid | 2-s2.0-0033363916 | - |
dc.type.rims | ART | - |
dc.citation.volume | 50 | - |
dc.citation.issue | 11 | - |
dc.citation.beginningpage | 1168 | - |
dc.citation.endingpage | 1175 | - |
dc.citation.publicationname | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | - |
dc.contributor.localauthor | Sung, Chang Sup | - |
dc.type.journalArticle | Article; Proceedings Paper | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.