Minmax regret linear resource allocation problems

Authors:
Igor Averbakh
Affiliations:
Department of Management, University of Toronto at Scarborough, 1265 Military Trail, Scarborough, Ont., Canada M1C 1A4
Venue:
Operations Research Letters
Year:
2004

Citing 2
Cited 2

Robust Convex Optimization

Mathematics of Operations Research
The robust spanning tree problem with interval data

Operations Research Letters

On the complexity of the continuous unbounded knapsack problem with uncertain coefficients

Operations Research Letters
Complexity of the min-max and min-max regret assignment problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

For minmax regret versions of some basic resource allocation problems with linear cost functions and uncertain coefficients (interval-data case), we present efficient (polynomial and pseudopolynomial) algorithms. As a by-product, we obtain an O(nlogn) algorithm for the interval data minmax regret continuous knapsack problem.