On the complexity of minmax regret linear programming.

Igor Averbakh Vasilij Lebedev

Published in: Eur. J. Oper. Res. (2005)

Keyphrases

linear programming
minmax regret
interval data
computational complexity
linear program
network flow
worst case
column generation
dynamic programming
random walk
upper bound
data clustering
feasible solution
single machine scheduling problem
optimization criterion
np hard
lower bound