:::

詳目顯示

回上一頁
題名:可能性最小生成樹問題之單一關鍵聯結
書刊名:管理資訊計算
作者:林高正 引用關係陳淑玲 引用關係曾文宏許惠馨
作者(外文):Lin, Kao-chengChen, Shu-lingTseng, Wen-hungHsu, Hey-sin
出版日期:2016
卷期:5:特刊4
頁次:頁157-170
主題關鍵詞:可能性最小生成樹期望值模式單一關鍵聯結參數分析可能性分配Possibilistic minimum spanning treesExpected value modelSingle most vital arcParametric analysisPossibility distribution
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:10
期刊論文
1.Tarjan, R. E.(1979)。Applications of path compression on balanced trees。Journal of the Association for Computing Machinery,26(4),690-715。  new window
2.Bazlamacci, C. F.、Hindi, K. S.(2001)。Minimum-weight spanning tree algorithms: A survey and empirical study。Computers and Operations Research,28(8),767-785。  new window
3.Chang, P.-T.、Lee, E.-S.(1999)。Fuzzy decision networks and deconvolution。Computers and mathematics with Applications,37(11/12),53-63。  new window
4.Dey, T. K.(1998)。Improved bounds on planar A-sets and related problems。Discrete and Computational Geometry,19(3),373-382。  new window
5.Frederickson, G. N.、Solis-Oba, R.(1999)。Increasing the weight of minimum spanning trees。Journal of Algorithms,33(2),244-266。  new window
6.Hsu, L.-H.、Jan, R.-H.、Lee, Y.-C.、Hung, C. N.、Chem, M.-S.(1991)。Finding the most vital edge with respect to minimum spanning tree in weighted graphs。Information Processing Letters,39(5),277-281。  new window
7.Iwano, K.、Katoh, N.(1993)。Efficient algorithms for finding the most vital edge of a minimum spanning tree。Information Processing Letters,48(5),211-213。  new window
8.Kasperski, A.、Zielinski, P.(2007)。On combinatorial optimization problems on matroids with uncertain weights。European Journal of Operational Research,177(2),851-864。  new window
9.Kruskal, J. B. Jr.(1956)。On the shortest spanning subtree of a graph and traveling salesman problem。Proceedings of AMS,7,45-50。  new window
10.Liang, W.(2001)。Finding the A most vital edges with respect to minimum spanning trees for fixed A。Discrete Applied Mathematics,113(2/3),319-327。  new window
11.Lin, K.-C.、Chem, M.-S.(1994)。The single most vital arc in the most economical path problem a parametric analysis。Computers & Operations Research,21(3),353-358。  new window
12.Liu, B.(1998)。Minimax chance constrained programming models for fuzzy decision systems。Information Sciences,112(1),25-38。  new window
13.Liu, B.、Iwamura, K.(1998)。Chance constrained programming with fuzzy parameters。Fuzzy Sets and Systems,94(2),227-237。  new window
14.Megiddo, N.(1979)。Combinatorial optimization with rational objective functions。Mathematics of Operations Research,4(4),414-424。  new window
15.Pettie, S.、Ramachandran, V.(2002)。An optimal minimum spanning tree algorithm。Journal of the Association for Computing Machinery,49(1),16-34。  new window
16.Prim, R. C.(1957)。Shortest connection networks and some generalizations。Bell System Technical Journal,36(6),1389-1401。  new window
17.Carlsson, C.、Fuller, R.(2001)。On Possibilistic Mean Value and Variance of Fuzzy Numbers。Fuzzy Sets and Systems,122(2),315-326。  new window
18.Dubois, D.、Prade, H.(1987)。The Mean Value of a Fuzzy Number。Fuzzy Sets and Systems,24(3),279-300。  new window
19.Fredman, Michael L.、Tarjan, Robert Endre(1987)。Fibonacci heaps and their uses in improved network optimization algorithms。Journal of the Association for Computing Machinery,34(3),596-615。  new window
20.Lin, Kao-Chêng、Chern, Maw-Sheng(1993)。The fuzzy shortest path problem and its most vital arcs。Fuzzy Sets and Systems,58(3),343-353。  new window
21.Lin, Kao-Chêng、Chern, Maw-Sheng(1993)。The most vital edges in the minimum spanning tree problem。Information Processing Letters,45(1),25-31。  new window
會議論文
1.林高正、鄧凱年、許惠馨(2008)。具模糊權數之最小生成樹問題的期望值模式。中華民國第十六屆模糊理論及其應用會議。桃園縣中壢:元智大學。  延伸查詢new window
2.Shen, H.(1997)。Finding the k most vital edges with respect to minimum spanning tree。The IEEE First Conference on Aerospace and Electronics,255-262。  new window
3.林高正、鄧凱年(2006)。具模糊權數之最小生成樹的可能性分配。中華民國第十四屆模糊理論及其應用會議。高雄縣:義守大學。  延伸查詢new window
學位論文
1.許惠馨(2009)。可能性最小生成樹問題與其關鍵聯結(碩士論文)。南臺科技大學,臺南縣永康市。  延伸查詢new window
2.鄧凱年(2007)。具模糊權數之最小生成樹問題(碩士論文)。南臺科技大學,臺南縣永康市。  延伸查詢new window
3.Lin, K.-C.(1993)。Most Vital Edges and Interdiction Problems of Network Systems(博士論文)。National Tsing-Hua University,Hsinchu。  new window
圖書
1.Cook, W. J.、Cunningham, W. H.、Pulleyblank, W. R.、Schrijver, A.(1998)。Combinatorial Optimization。New York:John-Wiley & Sons。  new window
2.Schrijver, A.(2003)。Combinatorial Optimization: Polyhedra and Efficiency。Berlin:Springer-Verlag。  new window
3.Bazaraa, M. S.、Jarvis, J. J.、Sherali, H. D.(1990)。Linear Programming and Network Flows。New York:John Wiley & Sons。  new window
圖書論文
1.Moret, B.、Shapiro, H.(1994)。An empirical assessment of algorithms for constructing a minimum spanning tree。DIM ACS Series in Discrete Mathematics and Theoretical Computer Science。Providence, RI:American Mathematics Society。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top