[KSCI] Korea Science Citation Index Service

Lower and Upper Bounding Strategies for the Network Disconnection Problem

김현준 (울산대학교 경영학부)
명영수 (단국대학교(천안) 경영학과)
박성수 (한국과학기술원 산업공학과)
오상민 (한국과학기술원 산업공학과)

Publication Information

Journal of the Korean Operations Research and Management Science Society / v.29, no.1, 2004 , pp. 113-125 More about this Journal

Abstract

The 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.

Keywords

Network Disconnection Problem; Combinatorial Optimization;

Citations & Related Records

Reference

1	Computing the strength of a graph / [ Gusfield,D. ] / SIAM Journal on Computing DOI
2	SONET toolkit : A decision support system for designing robust and cost-effective fiber-optic networks / [ Cosares,S.;Deutec,N.D.;Saniee,I.;Wasem,O.J. ] / Interfaces DOI ScienceOn
3	Mathematical Models and a Heuristic Algorithm for the Graph Disconnection Problem / [ Oh,S-M. ] / Master Dissertation, Korea Advanced Institute of Science and Technology
4	Tabu Search-Part II / [ Glover,F. ] / ORSA J. Computing DOI
5	A Cutting Plane Algorithm for Computing k-edge Survivability of a Network / [ Myung,Y.S.;Kim,H.J. ] / To appear in European Journal of Operational Research
6	Optimal attack and reinforcement of network / [ Cunningham,W.H. ] / Journal of the ACM DOI ScienceOn
7	Design of survivable networks / [ Grotschel,M.;Monma,C.L.;Stoer,M.;M.O.Ball(et al.)(eds.) ] / Network Models
8	Future Paths for Integer Programming and Links to Artificial Intellingence / [ Glover,F. ] / Comput. Operations Res.
9	An improved algorithm for the graph disconnection problem / [ Myung,Y.S.;Kim,H.J. ] / Proceeding of KIIE/KORMS Spring Conerence
10	Tabu Search-Part I / [ Glover,F. ] / ORSA J. Computing DOI
11	/ [ Kim,Y-K.;Yun,B-S.;Lee,S-B. ] / Meta Heuristic
12	Design of communication networks with survivability constraints / [ Myung,Y.S.;Kim,H.J.;Tcha,D.W. ] / Management Science DOI ScienceOn
13	An algorithm for the graph disconnection problem / [ Myung,Y.S.;Kim,H.J. ] / Working paper
14	/ [ Wu,T. ] / Fiber network survivability
15	Computing the disconnectivity of graph / [ Martel,C.;Nuckolls,G.;Sniegowski,D. ] / Working paper

KSCI

Lower and Upper Bounding Strategies for the Network Disconnection Problem 네트워크 단절문제에 대한 상한과 하한을 구하는 해법

Lower and Upper Bounding Strategies for the Network Disconnection Problem