论文信息 - Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios

Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios

In this paper a class of bottleneck combinatorial optimization problems with unknown costs is discussed. A scenario set containing all the costs realizations is specified and a possibility distribution in this scenario set is provided. Several models of uncertainty with solution algorithms for each uncertainty representation are presented.

Adam Kasperski | Pawel Zielinski

[1] Daniel Vanderpooten,et al. Min-max and min-max regret versions of combinatorial optimization problems: A survey , 2009, Eur. J. Oper. Res..

[2] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .

[3] Masahiro Inuiguchi,et al. Possibilistic linear programming: a brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem , 2000, Fuzzy Sets Syst..

[4] Didier Dubois,et al. Possibility Theory - An Approach to Computerized Processing of Uncertainty , 1988 .

[5] A Gerodimos,et al. Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[6] Igor Averbakh. Minmax regret solutions for minimax optimization problems with uncertainty , 2000, Oper. Res. Lett..

[7] Masahiro Inuiguchi,et al. Robust optimization under softness in a fuzzy linear programming problem , 1998, Int. J. Approx. Reason..