Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion

Operations Research Letters

Volumn 41, Issue 6, 2013, Pages 639-643

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

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Bottleneck problems; Combinatorial optimization; Computational complexity; OWA criterion; Robust optimization

Indexed keywords

AGGREGATION OPERATOR; APPROXIMATION RESULTS; BOTTLENECK PROBLEM; COMBINATORIAL OPTIMIZATION PROBLEMS; DECISION MAKING UNDER UNCERTAINTY; ORDERED WEIGHTED AVERAGING; OWA CRITERION; ROBUST OPTIMIZATION;

COMBINATORIAL OPTIMIZATION; COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL OPERATORS;

COSTS;

EID: 84884529042     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2013.08.014     Document Type: Article

References (18)

1. H. Aissi, C. Bazgan, and D. Vanderpooten Min-max and min-max regret versions of combinatorial optimization problems: a survey European Journal of Operational Research 197 2009 427 438
2. I. Averbakh Minmax regret solutions for minimax optimization problems with uncertainty Operations Research Letters 27 2000 57 65
3. I. Averbakh On the complexity of a class of combinatorial optimization problems with uncertainty Mathematical Programming 90 2001 263 272 (Pubitemid 33758924)
4. I. Averbakh Minmax regret bottleneck problems with solution-induced interval uncertainty structure Discrete Optimization 7 3 2010 181 190
5. A. Avidor, and U. Zwick Approximating MIN k-SAT Lecture Notes in Computer Science 2518 2002 465 475
6. A. Ben-Tal, L. El Ghaoui, and A. Nemirovski Robust Optimization Princeton Series in Applied Mathematics 2009 Princeton University Press Princeton, NJ
7. D. Bertsimas, and M. Sim Robust discrete optimization and network flows Mathematical Programming 98 2003 49 71
8. P.M. Camerini The minimax spanning tree problem and some extensions Information Processing Letters 7 1978 10 14
9. H.N. Gabow, and R.E. Tarjan Algorithms for two bottleneck optimization problems Journal of Algorithms 9 1988 411 417
10. L. Galand, P. Perny, and O. Spanjaard Choquet-based optimisation in multiobjective shortest path and spanning tree problems European Journal of Operational Research 204 2010 303 315
11. L. Galand, and O. Spanjaard Exact algorithms for OWA-optimization in multiobjective spanning tree problems Computers & Operations Research 39 2012 1540 1554
12. R. Kohli, R. Krishnamurti, and P. Mirchandani The minimum satisfiability problem SIAM Journal on Discrete Mathematics 7 1994 275 283
13. P. Kouvelis, and G. Yu Robust Discrete Optimization and its Applications 1997 Kluwer Academic Publishers
14. R.D. Luce, and H. Raiffa Games and Decisions: Introduction and Critical Survey 1957 Dover Publications Inc.
15. W. Ogryczak, and T. Śliwiński On solving linear programs with ordered weighted averaging objective European Journal of Operational Research 148 2003 80 91
16. A.P. Punnen A linear time algorithm for the maximum capacity path problem European Journal of Operational Research 53 1991 402 404
17. A.P. Punnen A fast algorithm for a class of bottleneck problems Computing 56 1996 397 401 (Pubitemid 126633715)
18. R.R. Yager On ordered weighted averaging aggregation operators in multi-criteria decision making IEEE Transaction on Systems, Man, and Cybernetics 18 1988 183 190