Title of article :
On the complexity of minmax regret linear programming
Author/Authors :
Igor Averbakh، نويسنده , , Vasilij Lebedev، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2005
Pages :
5
From page :
227
To page :
231
Keywords :
Combinatorial optimization , complexity theory , Uncertainty modeling , Minmax regret optimization
Journal title :
European Journal of Operational Research
Serial Year :
2005
Journal title :
European Journal of Operational Research
Record number :
215179
Link To Document :
بازگشت