Title of article :
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
Author/Authors :
Eduardo Conde، نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 2005
Keywords :
Polynomial algorithm , complexity , Minmax regret optimization
Journal title :
Operations Research Letters
Journal title :
Operations Research Letters
