$\require{mediawiki-texvc}$
  • 검색어에 아래의 연산자를 사용하시면 더 정확한 검색결과를 얻을 수 있습니다.
  • 검색연산자
검색연산자 기능 검색시 예
() 우선순위가 가장 높은 연산자 예1) (나노 (기계 | machine))
공백 두 개의 검색어(식)을 모두 포함하고 있는 문서 검색 예1) (나노 기계)
예2) 나노 장영실
| 두 개의 검색어(식) 중 하나 이상 포함하고 있는 문서 검색 예1) (줄기세포 | 면역)
예2) 줄기세포 | 장영실
! NOT 이후에 있는 검색어가 포함된 문서는 제외 예1) (황금 !백금)
예2) !image
* 검색어의 *란에 0개 이상의 임의의 문자가 포함된 문서 검색 예) semi*
"" 따옴표 내의 구문과 완전히 일치하는 문서만 검색 예) "Transform and Quantization"
쳇봇 이모티콘
안녕하세요!
ScienceON 챗봇입니다.
궁금한 것은 저에게 물어봐주세요.

논문 상세정보

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.

참고문헌 (16)

  1. On the Structure of Minimum-Weight k-connected Spanning Networks , Bienstock, D.;E. F. Brickell;C. L. Monma , SIAM Journal on Discrete Mathematics / v.3,pp.320-329, 1990
  2. Computer-Aided Design Procedures for Survivable Fiber Optic Networks , Cardwell, R. H.;C. L. Monma;T. H. Wu , IEEE Journal on Selected Areas in Communications / v.7,pp.1188-1197, 1989
  3. Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems , S. Chopra , SIAM Journal on Discrete Mathematics / v.5,pp.321-337, 1992
  4. Multi-Therminal Network Flows , R. E. Gomory;T. C. Hu , SIAM Journal on Applied Mathematics / v.9,pp.551-570, 1961
  5. Integer Polyhedra Associated with Certain Network Design Problems with Connectivity Constraints , M. Groetschel;C. L. Monma , SIAM Journal on Discrete Mathematics / v.3,pp.502-523, 1990
  6. Facets for polyhedra arising in the design of communication networks with low-connectivity constraints , M. Groetschel;C. L. Monma;M. Stoer , SIAM Journal on Optimization / v.2,pp.474-504, 1992
  7. Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low Connectivity Constraints , M. Groetschel;C. L. Monma;M. Stoer , Operations Research / v.40,pp.309-330, 1992
  8. Algorithm 447: Efficient Algorithms for Graph Manipulation , J. Hopcropt;R. E. Tarjan , Communications of ACM / v.16,pp.372-378, 1973
  9. Dividing a Graph into Triconnected Components , J. Hopcropt;R. E. Tarjan , SIAM Journal on Computing / v.2,pp.135-158, 1973
  10. Minimum-weight Two-connected Spanning Networks , C. L. Monma;B. S. Munson;W. R. Pulleyblank , Mathematical Programming / v.46,pp.153-171, 1990
  11. Methods for Designing Communications Networks with Certain Two-connected Survivability Constraints , C. L. Monma;D. F. Shallcross , Operations Research / v.37,pp.531-541, 1989
  12. An efficient Algorithm for the Minimum Capacity Cut Problem , M. Padberg;G. Rinaldi , Mathematical Programming / v.47,pp.19-36, 1990
  13. 3-Connectivity Augmentation Problems , T. Watanabe;A. Nakamura , Proceeding of IEEE International Symposium on Circuits and Systems / v.,pp.1847-1850, 1988
  14. A Smallest 3-Connectivity Augmentation of a Graph , T. Watanabe;A. Nakamura , Discrete Applied Mathematics / v.28,pp.183-186, 1990
  15. A Minimum 3-Connectivity Augmentation of a Graph , T. Watanabe;A. Nakamura , Journal of Computer and System Sciences / v.46,pp.91-128, 1993
  16. T. H. Wu , Fiber Network Service Survivability / v.,pp., 1992

이 논문을 인용한 문헌 (0)

  1. 이 논문을 인용한 문헌 없음

원문보기

원문 PDF 다운로드

  • ScienceON :

원문 URL 링크

원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다. (원문복사서비스 안내 바로 가기)

상세조회 0건 원문조회 0건

DOI 인용 스타일