DC Field | Value | Language |
---|---|---|
dc.contributor.author | 양희원 | ko |
dc.contributor.author | 박성수 | ko |
dc.date.accessioned | 2013-03-04T08:35:07Z | - |
dc.date.available | 2013-03-04T08:35:07Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2004-06 | - |
dc.identifier.citation | 한국국방경영분석학회지, v.30, no.1, pp.30 - 47 | - |
dc.identifier.issn | 1229-9898 | - |
dc.identifier.uri | http://hdl.handle.net/10203/82189 | - |
dc.description.abstract | This research considers a Network Diversion Problem (NDP) in the directed graph, which is to identify a minimum cost set of links to cut so that any communication paths from a designated source node to a destination node must include at least one link from a specified set of arcs which is called the diversion arcs. We identify a redundant constraint from an earlier formulation. The problem is known to be NP-hard, however a detailed proof has not been given. We provide the proof of the NP-hardness of this problem. We develop a tabu search algorithm that includes a preprocessing procedure with two steps for removing diversion arcs as well as reducing the problem size. Computational results of the algorithm on instances of general graphs and grid graphs are reported. | - |
dc.language | Korean | - |
dc.publisher | 한국국방경영분석학회 | - |
dc.title | 네트워크 전환문제에 대한 타부 탐색 해법 | - |
dc.title.alternative | A Tabu Search Algorithm for the Network Diversion Problem | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 30 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 30 | - |
dc.citation.endingpage | 47 | - |
dc.citation.publicationname | 한국국방경영분석학회지 | - |
dc.contributor.localauthor | 박성수 | - |
dc.contributor.nonIdAuthor | 양희원 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.