Minmax regret linear resource allocation problems

Minmax regret linear resource allocation problems

0.00 Avg rating0 Votes
Article ID: iaor20043339
Country: Netherlands
Volume: 32
Issue: 2
Start Page Number: 174
End Page Number: 180
Publication Date: Mar 2004
Journal: Operations Research Letters
Authors:
Keywords: allocation: resources
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.

Reviews

Required fields are marked *. Your email address will not be published.