Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights

European Journal of Operational Research

Volumn 200, Issue 3, 2010, Pages 680-687

  Kasperski, Adam ^a   Zieliński, Paweł ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Combinatorial optimization; Interval; Minmax regret; Possibility theory

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPLEXITY RESULTS; FUZZY INTERVAL; FUZZY WEIGHT; INTERVAL; MINMAX REGRET; OPTIMALITY; POSSIBILITY THEORY; SOLUTION CONCEPTS;

COMBINATORIAL OPTIMIZATION;

EID: 69749099918     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.01.044     Document Type: Article

References (28)

1. Adlakha V., Gladysz B., and Kamburowski J. Minimum flows in (s, t) planar networks. Networks 21 (1991) 767-773
2. H. Aissi, C. Bazgan, D. Vanderpooten, Complexity of the min-max (regret) versions of cut problems, ISAAC 2005, LNCS, vol. 3827, pp. 789-798, 2005.
3. Aissi H., Bazgan C., and Vanderpooten D. Complexity of the min-max and min-max regret assignment problems. Operations Research Letters 33 (2005) 634-640
4. H. Aissi, C. Bazgan, D. Vanderpooten, Min-max and min-max regret versions of combinatorial optimization problems: A survey, European Journal of Operational Research, in press, doi:10.1016/j.ejor.2008.09.012.
5. Aron I.D., and van Hentenryck P. On the complexity of the robust spanning tree problem with interval data. Operations Research Letters 32 (2004) 36-40
6. Averbakh I., and Lebedev V. Interval data minmax regret network optimization problems. Discrete Applied Mathematics 138 (2004) 289-301
7. Averbakh I., and Lebedev V. On the complexity of minmax regret linear programming. European Journal of Operational Research 160 (2005) 227-231
8. Chanas S., and Zieliński P. The computational complexity of the criticality problems in a network with interval activity times. European Journal of Operational Research 136 (2002) 541-550
9. Chanas S., and Zieliński P. On the hardness of evaluating criticality of activities in a planar network with duration intervals. Operations Research Letters 31 (2003) 53-59
10. Dubois D., Fargier H., and Galvagnon V. On latest starting times and floats in activity networks with ill-known durations. European Journal of Operational Research 147 (2003) 266-280
11. Dubois D., and Prade H. Possibility Theory: An Approach to Computerized Processing of Uncertainty (1988), Plenum Press, New York
12. Dubois D., Fargier H., and Fortemps P. Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge. European Journal of Operational Research 147 (2003) 231-252
13. D. Fernandez-Baca, G. Slutzki, D. Eppstein, Using sparsification for parametric minimum spanning tree problems, SWAT 1996, LNCS, vol. 1097, pp. 149-160, 1996.
14. J. Fortin, P. Zieliński, D. Dubois, H. Fargier, Interval analysis in scheduling, CP 2005, LNCS, vol. 3709, pp. 226-240, 2005.
15. Hoffman A.J., and Markowitz H. A note on shortest path, assignment and transportation problems. Naval Research Logistics Quarterly 10 (1963) 375-379
16. Inuiguchi M., and Sakawa M. Minimax regret solution to linear programming problems with an interval objective function. European Journal of Operational Research 86 (1995) 526-536
17. M. Inuiguchi, On possibilistic/ fuzzy optimization, IFSA 2007, LNAI, vol. 4527, pp. 351-360, 2007.
18. Inuiguchi M., and Sakawa M. Robust optimization under softness in a fuzzy linear programming problem. International Journal of Approximate Reasoning 18 (1998) 21-34
19. O.E. Karasan, M.C. Pinar, H. Yaman, The robust shortest path problem with interval data, Industrial Engineering Department, Bilkent University, 2001.
20. Kasperski A., and Zieliński P. An approximation algorithm for interval data minmax regret combinatorial optimization problems. Information Processing Letters 97 (2006) 177-180
21. Kasperski A., and Zieliński P. On combinatorial optimization problems on matroids with uncertain weights. European Journal of Operational Research 177 (2007) 851-864
22. Kouvelis P., and Yu G. Robust Discrete Optimization and its Applications (1997), Kluwer Academic Publishers., Boston
23. Lawler E.L. Combinatorial Optimization: Networks and Matroids (1976), Holt, Rinehart and Winston, New York
24. Montemanni R., Gambardella L.M., and Donati A.V. A branch and bound algorithm for the robust shortest path problem with interval data. Operations Research Letters 32 (2004) 225-232
25. Okada S. Fuzzy shortest path problems incorporating interactivity among paths. Fuzzy Sets and Systems 142 (2004) 335-357
26. Young N., Tarjan R., and Orlin J. Faster parametric shortest path and minimum balance algorithms. Networks 21 (1991) 205-221
27. Yaman H., Karaşan O.E., and Pinar M.C. The robust spanning tree problem with interval data. Operations Research Letters 29 (2001) 31-40
28. Zieliński P. On computing the latest starting times and floats of activities in a network with imprecise durations. Fuzzy Sets and Systems 150 (2005) 53-76