:::

詳目顯示

回上一頁
題名:具模糊權數網路之最小生成樹可能性分配
書刊名:管理資訊計算
作者:林高正曾文宏鄧凱年
作者(外文):Lin, Kao-chengTseng, Wen-hungDeng, Kai-nian
出版日期:2020
卷期:9:特刊1
頁次:頁40-52
主題關鍵詞:模糊網路最小生成樹可能性分配擴充原則參數分析Fuzzy networksMinimum spanning treePossibility distributionExtension principleParametric analysis
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:1
  • 點閱點閱:9
本文在探討當聯結權數為模糊數時,如何求解網路最小生成樹的可能性分配。首先,指出可利用Zadeh的擴充原則將問題轉成最小生成樹參數分析問題。接著,分別以最小生成樹問題之路徑最佳化條件與割集最佳化條件為基礎,提出兩個求解最小生成樹參數分析的方法。
In this paper, we consider the problem of finding the possibility distribution of minimum spanning tree in a network with fuzzy arc weights. At first, it is shown that this problem can be transformed into a parametric minimum spanning tree problem, using Zadeh's extension principle. Then, two algorithms, based on the path optimality and cut optimality respectively, are proposed to solve the parametric analysis problem.
期刊論文
1.Chang, P.-T.、Lee, E.-S.(1999)。Fuzzy decision networks and deconvolution。Computers and mathematics with Applications,37(11/12),53-63。  new window
2.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
3.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
4.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
5.Liu, B.(1998)。Minimax chance constrained programming models for fuzzy decision systems。Information Sciences,112(1),25-38。  new window
6.Liu, B.、Iwamura, K.(1998)。Chance constrained programming with fuzzy parameters。Fuzzy Sets and Systems,94(2),227-237。  new window
7.Pettie, S.、Ramachandran, V.(2002)。An optimal minimum spanning tree algorithm。Journal of the Association for Computing Machinery,49(1),16-34。  new window
8.Bertsimas, D.(1990)。The probabilistic minimum spanning tree problem。Networks,20(3),245-275。  new window
9.Dubois, D.、Prade, H.(1992)。When upper probabilities are possibility measures。Fuzzy Sets and Systems,49(1),65-74。  new window
10.Frieze, A. M.(1985)。On the value of a random minimum spanning tree problem。Discrete Applied Mathematics,10(1),47-56。  new window
11.Liang, W.(2001)。Finding the k most vital edges with respect to minimum spanning trees for fixed k。Discrete Applied Mathematics,113(2/3),319-327。  new window
12.Prim, R. C.(1957)。Shortest connection networks and some generalizations。Bell System Technical Journal,36(6),1389-1401。  new window
13.Dubois, D.、Prade, H.(1979)。Fuzzy real algebra: Some results。Fuzzy Sets and Systems,2(4),327-348。  new window
14.林高正、曾文宏、邱清爐、許惠馨(20170800)。以機遇限制規劃模式求解可能性最小生成樹問題。管理資訊計算,6(特刊2),82-95。new window  延伸查詢new window
15.Dubois, D.、Prade, H.(1997)。The Three Semantics of Fuzzy Sets。Fuzzy Sets and Systems,90(2),141-150。  new window
16.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
17.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
18.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
19.Zadeh, Lotfi Asker(1999)。Fuzzy sets as a basis for a theory of possibility。Fuzzy sets and systems,100(S1),9-34。  new window
20.林高正、曾文宏、鄧凱年、許惠馨(20190800)。以期望值模式求解可能性最小生成樹問題。管理資訊計算,8(特刊2),37-50。new window  延伸查詢new window
21.Kulkarni, V. G.(1986)。Minimum spanning trees in undirected networks with exponentially distributed arc weights。Networks,18(2),111-124。  new window
22.Steele, J. M.(1987)。On Frieze's χ(3) limit for lengths of minimal spanning trees。Discrete Applied Mathematics,18(1),99-103。  new window
23.Verdegay, J. L.(1984)。A dual approach to solve the fuzzy linear programming problem。Fuzzy Sets and Systems,14(2),131-141。  new window
24.Zadeh, Lotfi Asker(1965)。Fuzzy sets。Information and Control,8(3),338-353。  new window
圖書
1.Klement, E. P.、Mesiar, R.、Pap, E.(2000)。Triangular Norms。Boston, Massachusetts:Kluwer Academic Publishers。  new window
2.Dubois, D.、Prade, H.(2000)。Fundamentals of Fuzzy Sets。Dordrecht:Kluwer Academic Publishers。  new window
3.Klir, G. J.、Yuan, B.(1995)。Fuzzy Sets and Fuzzy Logics: Theory and Applications。Upper Saddle River, New Jersey:Prentice-Hall。  new window
4.Ball, M. O.、Magnanti, T. L.、Monma, C. L.、Nemhauser, G. L.(1995)。Handbooks in Operations Research and Management Science, Volume 8: Network Routing。Amsterdam:Elsevier Science。  new window
5.Ball, M. O.、Magnanti, T. L.、Monma, C. L.、Nemhauser, G. L.(1995)。Handbooks in Operations Research and Management Science, Volume 7: Network Models。Amsterdam:Elsevier Science。  new window
6.Ahuja, R. K.、Orlin, J. B.、Magnanti, T. L.(1993)。Network Flows: Theory, Algorithms, and Applications。Prentice-Hall。  new window
7.Bazaraa, M. S.、Jarvis, J. J.、Sherali, H. D.(1990)。Linear Programming and Network Flows。New York:John Wiley & Sons。  new window
8.Korte, B., Vygen, J.(2012)。Combinatorial Optimization: Theory and Algorithms。Heidelberg:Springer-Verlag。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
:::
QR Code
QRCODE