.png){kind=icon}
Return
On combinatorial optimization problems on matroids with uncertain weights
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2005.12.033.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper the combinatorial optimization problem on weighted matroid is considered. It is assumed that the weights in the problem are ill-known and they are modeled as fuzzy intervals. The optimality of solutions and the optimality of elements are characterized. This characterization is performed in the setting of possibility theory. A method of choosing a solution under uncertainty is also proposed. (c) 2006 Elsevier B.V. All rights reserved.
Keywords:
matroid
interval
fuzzy interval
possibility theory
combinatorial optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveEffects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
PREAI
ShareSave
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more