Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems

4OR

Volumn 4, Issue 4, 2006, Pages 347-350

  Aissi, Hassene ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Approximation; Combinatorial optimization; Complexity; Data association; Min max; Min max regret; Robustness analysis

Indexed keywords

EID: 33845343265     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-006-0004-6     Document Type: Article

References (12)

1. Aissi H, Bazgan C, Vanderpooten D (2005a) Complexity of the min-max and min-max regret assignment problem. Oper Res Lett 33(6):634-640
2. Aissi H, Bazgan C, Vanderpooten D (2005b) Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack. In: Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005), Mallorca, Spain, LNCS 3669, pp 862-873. Springer, Berlin Heidelberg New York
3. Aissi H, Bazgan C, Vanderpooten D (2005c) Pseudo-polynomial time algorithms for min-max and min-max regret problems. In: Proceedings of the 5th International Symposium on Operations Research and Its Applications (ISORA 2005), Tibet, China, Lecture Notes in Operations Research, pp 171-178. World Publishing Corporation, 2005c
4. Aissi H, Bazgan C, Vanderpooten D (2005d) min-max (regret) versions of cut problems. In: Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC 2005), Sanya, Hainan, China, LNCS 3827, pp 789-798. Springer, Berlin Heidelberg New York
5. Aissi H, Vanderpooten D, Vanpeperstraete JM (2005e) Robust approaches for the data association problem. In: Proceedings CD-ROM of the 8th International Conference on Information Fusion (FUSION 2005), Philadelphia, USA, 2005e, 6 pp
6. Averbakh I (2001) On the complexity of a class of combinatorial optimization problems with uncertainty. Math Program 90:263-272
7. Averbakh I, Lebedev V (2004) Interval data min-max regret network optimization problems. Discret Appl Math 138(3):289-301
8. Kasperski A, Zieliński P (2006) An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf Process Lett 97(5)
9. Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer, Boston
10. Montemanni R (2006) A Benders decomposition approach for the robust spanning tree with interval data. Eur J Oper Res (to appear)
11. Montemanni R, Gambardella L (2005) The robust shortest path problem with interval data via Benders decomposition. 4OR 3(4):315-328
12. Pattipati KR, Deb S, Bar-Shalom Y, Washburn R (1992) A new relaxation algorithm and passive sensor data association. IEEE Trans Autom Control 37(2):198-213