Title of article
Approximating k-cuts using network strength as a Lagrangean relaxation
Author/Authors
R. Ravi، نويسنده , , Amitabh Sinha، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
14
From page
77
To page
90
Keywords
approximation algorithm , Lagrangean relaxation , Combinatorial optimization , graph theory
Journal title
European Journal of Operational Research
Serial Year
2008
Journal title
European Journal of Operational Research
Record number
217412
Link To Document