Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems
暂无分享,去创建一个
[1] Didier Dubois,et al. On latest starting times and floats in activity networks with ill-known durations , 2003, Eur. J. Oper. Res..
[2] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[3] Didier Dubois,et al. Interval Analysis in Scheduling , 2005, CP.
[4] Didier Dubois,et al. Gradual Numbers and Their Application to Fuzzy Interval Analysis , 2008, IEEE Transactions on Fuzzy Systems.
[5] David Eppstein,et al. Using Sparsification for Parametric Minimum Spanning Tree Problems , 1996, Nord. J. Comput..
[6] Robert E. Tarjan,et al. Faster parametric shortest path and minimum-balance algorithms , 1991, Networks.
[7] Didier Dubois,et al. A generalized vertex method for computing with fuzzy intervals , 2004, 2004 IEEE International Conference on Fuzzy Systems (IEEE Cat. No.04CH37542).
[8] Andrzej Lingas,et al. Algorithm Theory — SWAT'96 , 1996, Lecture Notes in Computer Science.
[9] Peter van Beek,et al. Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings , 2005, CP.
[10] Pawel Zielinski,et al. The computational complexity of the criticality problems in a network with interval activity times , 2002, Eur. J. Oper. Res..
[11] Eugene L. Lawler,et al. The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..
[12] Michael O. Ball,et al. Bicriteria product design optimization: An efficient solution procedure using AND/OR trees , 2002 .
[13] Ramon E. Moore. Methods and applications of interval analysis , 1979, SIAM studies in applied mathematics.
[14] Adam Kasperski,et al. On combinatorial optimization problems on matroids with uncertain weights , 2007, Eur. J. Oper. Res..
[15] Didier Dubois,et al. Gradual elements in a fuzzy set , 2008, Soft Comput..
[16] Arie Tzvieli. Possibility theory: An approach to computerized processing of uncertainty , 1990, J. Am. Soc. Inf. Sci..