DC Field | Value | Language |
---|---|---|
dc.contributor.author | 박성수 | ko |
dc.contributor.author | 김현준 | ko |
dc.contributor.author | 명영수 | ko |
dc.contributor.author | 오상민 | ko |
dc.date.accessioned | 2013-03-04T18:07:32Z | - |
dc.date.available | 2013-03-04T18:07:32Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2004-03 | - |
dc.identifier.citation | 한국경영과학회지, v.29, no.1, pp.113 - 125 | - |
dc.identifier.issn | 1225-1119 | - |
dc.identifier.uri | http://hdl.handle.net/10203/83562 | - |
dc.description.abstract | he network disconnection problem ms to find a set of edges such that the total cost of removing the edges is no more than a given budget and the weight of nodes disconnected from a designated source by removing edges is maximized. Martel et at. have shown that the problem with unit capacity and unit demand Is NP-hard and Myung and kim present an integer programming formulation and develop an algorithm that Includes a preprocessing procedure and lower and upper bounding strateagies. in this paper, we present new findings on the properties of the optimal solution and an alternative integer programming formulation, based on which new lower and upper bounding strategies are developed. Computational results for evaluating the performance of the proposed algorithm are also presented. | - |
dc.language | Korean | - |
dc.publisher | 한국경영과학회 | - |
dc.title | 네트워크 단절문제에 대한 상한과 하한을 구하는 해법 | - |
dc.title.alternative | Lower and Upper Bounding Strategies for the Network Disconnection Problem | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 29 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 113 | - |
dc.citation.endingpage | 125 | - |
dc.citation.publicationname | 한국경영과학회지 | - |
dc.identifier.kciid | ART000934095 | - |
dc.contributor.localauthor | 박성수 | - |
dc.contributor.nonIdAuthor | 김현준 | - |
dc.contributor.nonIdAuthor | 명영수 | - |
dc.contributor.nonIdAuthor | 오상민 | - |
dc.subject.keywordAuthor | Network Disconnection Problem | - |
dc.subject.keywordAuthor | Combinatorial Optimization | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.