A possibilistic approach to combinatorial optimization problems on fuzzy-valued matroids

Authors:
Adam Kasperski;Paweł Zieliński
Affiliations:
Institute of Industrial Engineering and Management, Wrocław University of Technology, Wrocław, Poland;Institute of Mathematics and Computer Science, Wrocław University of Technology, Wrocław, Poland
Venue:
WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications
Year:
2005

Citing 3
Cited 5

Resource allocation problems: algorithmic approaches

Resource allocation problems: algorithmic approaches
A constraint satisfaction approach to the robust spanning tree problem with interval data

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
The robust spanning tree problem with interval data

Operations Research Letters

A new approach to the fuzzification of matroids

Fuzzy Sets and Systems
(L, M)-fuzzy matroids

Fuzzy Sets and Systems
Axioms for bases of closed regular fuzzy matroids

Fuzzy Sets and Systems
Connectedness of refined Goetschel--Voxman fuzzy matroids

Fuzzy Sets and Systems
Characterizations and applications of M-fuzzifying matroids

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper several combinatorial optimization problems on fuzzy weighted matroid are considered. It is shown how to characterize the degrees of optimality of elements in the setting of the possibility theory.