Possibilistic bottleneck combinatorial optimization problems with ill-known weights

AbstractIn this paper a general bottleneck combinatorial optimization problem with uncertain element weights modeled by fuzzy intervals is considered. A possibilistic formalization of the problem and solution concepts in this setting, which lead to compute robust solutions under fuzzy weights, are given. Some algorithms for finding a solution according to the introduced concepts and evaluating optimality of solutions and elements are provided. These algorithms are polynomial for bottleneck combinatorial optimization problems with uncertain element weights, if their deterministic counterparts are polynomially solvable