On the complexity of minmax regret linear programming

Igor Averbakh, Vasilij Lebedev. On the complexity of minmax regret linear programming. European Journal of Operational Research, 160(1):227-231, 2005. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: