DC Field | Value | Language |
---|---|---|
dc.contributor.author | Koh, S.J. | ko |
dc.contributor.author | Lee, C.Y. | ko |
dc.date.accessioned | 2011-08-10T02:19:12Z | - |
dc.date.available | 2011-08-10T02:19:12Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1997-07 | - |
dc.identifier.citation | JOURNAL OF THE KOREAN OR/MS SOCIETY, v.22, no.3, pp.59 - 80 | - |
dc.identifier.issn | 1225-1119 | - |
dc.identifier.uri | http://hdl.handle.net/10203/24818 | - |
dc.description.abstract | Designing highly survivable interoffice telecommunication networks is considered. The problem is formulated as a minimum-cost network design problem with three node connectivity constraints. These valid and facet-defining inequalities for the convex hull of the solution are presented. A branch and cut algorithm is proposed based on the inequalities to obtain the optimal solution. With the lower bound by the cutting plane algorithm, a delete-ink heuristic is proposed to otain a good upper bound in the branch and bound procedure. The effeciveness of the branch and cut algorithm is demonstrated with computational results for a variety of problem sets : different lower bounds, two types of link costs and large number of links. The cutting plane procedure based on the three inequalities provides excellent lower bounds to the optimal solutions. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | 한국경영과학회 | - |
dc.title | Design of Survivable Communication Networks with High Connectivity Constraints | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 22 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 59 | - |
dc.citation.endingpage | 80 | - |
dc.citation.publicationname | JOURNAL OF THE KOREAN OR/MS SOCIETY | - |
dc.contributor.localauthor | Lee, C.Y. | - |
dc.contributor.nonIdAuthor | Koh, S.J. | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.