A 2-approximation for minmax regret problems via a mid-point scenario optimal solution

Authors:
Eduardo Conde
Affiliations:
Departamento de Estadística e Investigación Operativa, Facultad de Matemáticas, Universidad de Sevilla, Campus Universitario de Reina Mercedes, 41012 Sevilla, Spain
Venue:
Operations Research Letters
Year:
2010

Citing 4
Cited 0

Robust scheduling to hedge against processing time uncertainty in single-stage production

Management Science
Complexity of robust single facility location problems on networks with uncertain edge lengths

Discrete Applied Mathematics
An approximation algorithm for interval data minmax regret combinatorial optimization problems

Information Processing Letters
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this note, a 2-approximation method for minmax regret optimization problems is developed which extends the work of Kasperski and Zielinski [A. Kasperski, P. Zielinski, An approximation algorithm for interval data minmax regret combinatorial optimization problems, Information Processing Letters 97 (2006) 177-180] from finite to compact constraint sets.