Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Interval data minmax regret network optimization problems
Discrete Applied Mathematics
An approximation algorithm for interval data minmax regret combinatorial optimization problems
Information Processing Letters
Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
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
On the sure criticality of tasks in activity networks withimprecise durations
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
On the complexity of the robust spanning tree problem with interval data
Operations Research Letters
The robust spanning tree problem with interval data
Operations Research Letters
Combinatorial optimization in system configuration design
Automation and Remote Control
Connection situations under uncertainty and cost monotonic solutions
Computers and Operations Research
Cooperative interval games: Mountain situations with interval data
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
In this paper the minimum spanning tree problem in a given connected graph is considered. It is assumed that the edge costs are not precisely known and they are specified as fuzzy intervals. Possibility theory is applied to characterize the optimality of edges of the graph and to choose a spanning tree under fuzzy costs.