Solving combinatorial optimization problems with fuzzy weights

IEEE International Conference on Fuzzy Systems

Volumn , Issue , 2008, Pages 318-323

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

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; FUZZY LOGIC; FUZZY SYSTEMS; INTEGER PROGRAMMING; NUCLEAR PROPULSION; OPTIMIZATION;

BRANCH AND BOUNDS; COMBINATORIAL OPTIMIZATION PROBLEMS; FUZZY WEIGHTS; GENERAL METHODS; INTERVAL PROBLEMS; MAXIMAL REGRETS; MIXED INTEGER PROGRAMMINGS; NP-HARD; OPTIMALITY;

PROBLEM SOLVING;

EID: 55249090912     PISSN: 10987584     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FUZZY.2008.4630384     Document Type: Conference Paper

References (24)

1. I. D. Aron and P. van Hentenryck, "A Constraint Satisfaction Approach to the Robust Spanning Tree with Interval Data," in Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence. Edmonton, Canada, August 2002.
2. I. Averbakh and V. Lebedev, "Interval data minmax regret network optimization problems," Discrete Applied Mathematics, vol. 138, pp. 289-301, 2004.
3. R. Montemanni and L. Gambardella, "A branch and bound algorithm for the robust spanning tree problem with interval data," European Journal of Operational Research, vol. 161, pp. 771-779, 2005.
4. R. Montemanni, L. Gambardella, and A. Donati, "A branch and bound algorithm for the robust shortest path problem with interval data," Operations Research Letters, vol. 32, pp. 225-232, 2005.
5. H. Aissi, C. Bazgan, and D. Vanderpooten, "Complexity of the minmax and min-max regret assignment problems," Operations Research Letters, vol. 33, pp. 634-640, 2005.
6. _. "Complexity of the min-max (regret) versions of cut problems," In ISAAC 2005, ser. Lecture Notes in Computer Science. Springer-Verlag. 2005, vol. 3827, pp. 789-798.
7. P. Kouvelis and G. Yu, Robust Discrete Optimization and its applications. Kluwer Academic Publishers, 1997.
8. O. E. Karasan, M. C. Pinar, and H. Yaman, "The robust shortest path problem with interval data," August 2001, industrial Engineering Department, Bilkent University.
9. S. Okada, "Fuzzy shortest path problems incorporating interactivity among paths," Fuzzy Sets and Systems, vol. 142, pp. 335-357, 2004.
10. S. Okada and T. Soper, "A shortest path problem on a network with fuzzy arc lengths," Fuzzy Sets and Systems, vol. 109, pp. 129-140, 2000.
11. C. M. Klein, "Fuzzy shortest paths," Fuzzy Sets and Systems, vol. 39, pp. 27-41, 1991.
12. S. Chanas and W. Kołodziejczyk, "Maximum flow in a network with fuzzy arc capacities," Fuzzy Sets and Systems, vol. 8, pp. 165-173, 1982.
13. _, "Real-valued flows in a network with fuzzy arc capacities," Fuzzy Sets and Systems, vol. 13, pp. 139-151, 1984.
14. A. Kasperski and P. Zieliński, "On combinatorial optimization problems on matroids with uncertain weights," European Journal of Operational Research, vol. 177, pp. 858-864, 2007.
15. S. Chanas and D. Kuchta, "Discrete fuzzy optimization," in Fuzzy Sets in Decision Analysis, Operation Research and Statistics, R. Słowiński, Ed. Kluwer Academic Publishers, 1998, pp. 249-280.
16. D. Dubois and H. Prade, Possibility theory: an approach to computerized processing of uncertainty. New York: Plenum Press, 1988.
17. M. Inuiguchi and M. Sakawa, "Robust optimization under softness in a fuzzy linear programming problem," International Journal of Approximate Reasonning, vol. 18, pp. 21-34, 1998.
18. M. Inuiguchi, "On possibilistic/fuzzy optimization," in Foundations of Fuzzy Logic and Soft Computing, IFSA 2007, ser. Lecture Notes in Artificial Intelligence 4529. Springer-Verlag, 2007, pp. 351-360.
19. H. Yaman, M. C. Pinar, and O. E. Karasan, "The robust spanning tree problem with interval data," Operations Research Letters, vol. 29, pp. 31-40, 2001.
20. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: theory, algorithms, and applications. Englewood Cliffs, New Jersey: Prentice Hall, 1993.
21. C. Papadimitriou and K. Steiglitz, Combinatorial Optimization. Mineola, New York: Dover Publications, INC, 1998.
22. E. Conde, "An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion," Math. Program, vol. 100, no. 2, pp. 345-353, 2004.
23. A. Kasperski and P. Zieliński, "The robust shortest path problem in series-parallel multidigraphs with interval data," Operations Research Letters, vol. 34(1), pp. 69-76, 2006.
24. _, "An approximation algorithm for interval data minmax regret combinatorial optimization problems," Information Processing Letters, vol. 97, pp. 177-180, 2006.