Using gradual numbers for solving fuzzy-valued combinatorial optimization problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4529 LNAI, Issue , 2007, Pages 656-665

  Kasperski, Adam ^a   Zieliñski, Paweł ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; NUMERICAL METHODS; PROBLEM SOLVING;

FUZZY WEIGHTS; INTERVAL-VALUED PROBLEMS; POSSIBILITY DISTRIBUTIONS;

FUZZY LOGIC;

EID: 37249037101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72950-1_65     Document Type: Conference Paper

References (14)

1. Chanas, S., Zieliński, P.: The computational complexity of the criticality problems in a network with interval activity times. Eur. J. Oper. Res. 136 (2002) 541-550.
2. Dubois, D., Prade, H.: Possibility theory: an approach to computerized processing of uncertainty. Plenum Press, New York, 1988.
3. Dubois, D., Fargier, H., Galvagnon, V.: On latest starting times and floats in activity networks with ill-known durations. Eur. J. Oper. Res. 147 (2003) 266-280.
4. Dubois, D., Fargier, H., Fortin, J.: A generalized vertex method for computing with fuzzy intervals. In: Fuzz'IEEE (2004) 541-546.
5. Dubois, D., Prade, H.: Gradual Elements in a Fuzzy Set. Soft Comput. To appear.
6. Fernandez-Baca, D., Slutzki, G., Eppstein, D.: Using sparsification for parametric minimum spanning tree problems. In: SWAT 1996 LNCS 1097, pp. 149-160, 1996.
7. Fortin, J., Zieliński, P., Dubois, D., Fargier, H.: Interval analysis in scheduling. In: CP 2005, LNCS 3709, pp. 226-240, 2005
8. Fortin, J., Dubois, D., Fargier, H.: Gradual Numbers and their Application to Fuzzy Interval Analysis. IEEE T. Fuzzy Syst. To appear.
9. Kasperski, A., Zieliński, P.: On combinatorial optimization problems on matroids with uncertain weights. Eur. J. Oper. Res. 177 (2007) 851-864.
10. Moore, R.: Methods and applications of interval analysis. SIAM Studies in Applied Mathematics, 1979.
11. Papadimitriou, C., Steiglitz, K.: Combinatorial optimization, algorithms and complexity. Dover Publications Inc., Mineola, New York., 1998.
12. Raghavan, S., Ball, M. O., Trichur, V. S.: Bicriteria product design optimization: An efficient solution procedure using AND/OR trees. Nav. Res. Log. 49 (2002) 574-592.
13. Young, N., Tarjan, R., Orlin, J.: Faster Parametric Shortest Path and Minimum Balance Algorithms. Networks 21 (1991) 205-221.
14. Valdes, J., Tarjan, R. E., Lawler, E. L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2) 298-313, 1982.