Improved polynomial algorithms for robust bottleneck problems with interval data

Authors:
A. Volgenant;C. W. Duin
Affiliations:
Operations Research Group, Faculty of Economics and Econometrics, University of Amsterdam, Roetersstraat 11, 1018 WB Amsterdam, The Netherlands;Operations Research Group, Faculty of Economics and Econometrics, University of Amsterdam, Roetersstraat 11, 1018 WB Amsterdam, The Netherlands
Venue:
Computers and Operations Research
Year:
2010

Citing 9
Cited 0

Algorithms for two bottleneck optimization problems

Journal of Algorithms
An O(n log2n) algorithm for the maximum weighted tardiness problem

Information Processing Letters
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem

Discrete Applied Mathematics
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion

Mathematical Programming: Series A and B
Complexity of minimizing the total flow time with interval data and minmax regret criterion

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Minmax regret solutions for minimax optimization problems with uncertainty

Operations Research Letters
On the complexity of the robust spanning tree problem with interval data

Operations Research Letters
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

To model uncertainties in a problem one can provide intervals of uncertainty specifying a range for each uncertain parameter value. To hedge against 'worst-case scenarios', i.e., most unwelcome realizations of the uncertain parameters after a solution has been determined, the minmax-regret criterion has been adopted in robust optimization. Within this field, we consider bottleneck problems with one or more uncertain parameter functions. We apply a known polynomial time solution scheme for a number of specific problems of this type with one uncertain parameter function. This leads to improved algorithms of reduced complexity, e.g., for the bottleneck Steiner tree problem and the bottleneck assignment problem. Further, we formulate a framework to solve single machine scheduling problems in polynomial time under the maximum tardiness criterion, with up to three uncertain parameter functions.