On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data

Operations Research Letters

Volumn 35, Issue 4, 2007, Pages 525-532

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

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Combinatorial optimization; FPTAS; Minmax regret

Indexed keywords

COMBINATORIAL OPTIMIZATION; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

MINMAX REGRET; POLYNOMIAL TIME APPROXIMATION SCHEME (FPTAS);

PROBLEM SOLVING;

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

References (11)

1. Aissi H., Bazgan C., and Vanderpooten D. Complexity of the min-max and min-max regret assignment problems. Oper. Res. Lett. 33 (2005) 634-640
2. Aron I., and Van Hentenryck P. A constraint satisfaction approach to the robust spanning tree with interval data. Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence. Edmonton, Canada (August 2002)
3. Averbakh I., and Lebedev V. Interval data minmax regret network optimization problems. Discrete. Appl. Math. 138 (2004) 289-301
4. Karasan O.E., Pinar M.C., and Yaman H. The robust shortest path problem with interval data, Technical Report (2001), Bilkent University
5. Kasperski A., and Zieliński P. An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inform. Process. Lett. 97 (2006) 177-180
6. Kasperski A., and Zieliński P. The robust shortest path problem in series-parallel multidigraphs with interval data. Oper. Res. Lett. 34 (2006) 69-76
7. Kouvelis P., and Yu G. Robust Discrete Optimization and its Applications (1997), Kluwer Academic Publishers, Dordrecht
8. Montemanni R., and Gambardella L.M. A branch and bound algorithm for the robust spanning tree problem with interval data. European J. Oper. Res. 161 (2004) 771-779
9. Montemanni R., Gambardella L.M., and Donati A.V. A branch and bound algorithm for the robust shortest path problem with interval data. Oper. Res. Lett. 32 (2004) 225-232
10. Valdes J., Tarjan R.E., and Lawler E.L. The recognition of series parallel digraphs. SIAM J. Comput. 11 (1982) 298-313
11. Yaman H., Karaşan O.E., and Pinar M.C. The robust spanning tree problem with interval data. Oper. Res. Lett. 29 (2001) 31-40