An approximation algorithm for interval data minmax regret combinatorial optimization problems

Authors:
Adam Kasperski;Paweł Zieliński
Affiliations:
Institute of Industrial Engineering and Management, Wrocław University of Technology, Wrocław, Poland;Institute of Mathematics and Computer Science, Wrocław University of Technology, Wrocław, Poland
Venue:
Information Processing Letters
Year:
2006

Citing 6
Cited 4

Interval data minmax regret network optimization problems

Discrete Applied Mathematics
An exact algorithm for the robust shortest path problem with interval data

Computers and Operations Research
A constraint satisfaction approach to the robust spanning tree problem with interval data

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
On the complexity of the robust spanning tree problem with interval data

Operations Research Letters
The robust spanning tree problem with interval data

Operations Research Letters
A branch and bound algorithm for the robust shortest path problem with interval data

Operations Research Letters

The minimum spanning tree problem with fuzzy costs

Fuzzy Optimization and Decision Making
Simulated annealing algorithm for the robust spanning tree problem

Journal of Heuristics
Choosing robust solutions in discrete optimization problems with fuzzy costs

Fuzzy Sets and Systems
On the approximability of minmax (regret) network optimization problems

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

The general problem of minimizing the maximal regret in combinatorial optimization problems with interval data is considered. In many cases, the minmax regret versions of the classical, polynomially solvable, combinatorial optimization problems become NP-hard and no approximation algorithms for them have been known. Our main result is a polynomial time approximation algorithm with a performance ratio of 2 for this class of problems.