Title of article :
Approximation of min–max and min–max regret versions of some combinatorial optimization problems
Author/Authors :
Hassene Aissi، نويسنده , , Cristina Bazgan، نويسنده , , Daniel Vanderpooten، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2007
Pages :
10
From page :
281
To page :
290
Keywords :
Min–max , Min–max regret , approximation , FPTAS , Shortest path , Knapsack , minimum spanning tree
Journal title :
European Journal of Operational Research
Serial Year :
2007
Journal title :
European Journal of Operational Research
Record number :
216697
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=216697
بازگشت