Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Resource allocation problems: algorithmic approaches
Resource allocation problems: algorithmic approaches
Introduction to algorithms
Gradual elements in a fuzzy set
Soft Computing - A Fusion of Foundations, Methodologies and Applications
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
Gradual Numbers and Their Application to Fuzzy Interval Analysis
IEEE Transactions on Fuzzy Systems
The robust spanning tree problem with interval data
Operations Research Letters
Connectedness of refined Goetschel--Voxman fuzzy matroids
Fuzzy Sets and Systems
| Hi-index | 0.20 |
In this paper a class of matroidal combinatorial optimization problems with imprecise weights of elements is considered. The imprecise weights are modeled by intervals and fuzzy intervals. The concepts of possible and necessary optimality under imprecision are recalled. Some efficient methods for evaluating the possible and necessary optimality of elements in the interval-valued problems are proposed. Some efficient algorithms for computing the exact degrees of possible and necessary optimality of elements in the fuzzy-valued problems are designed.