Title of article :
A minimax assignment problem in treelike communication networks
Author/Authors :
Rainer E. Burkard، نويسنده , , Eranda Cela، نويسنده , , Gerhard J. Woeginger، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1995
Pages :
15
From page :
670
To page :
684
Keywords :
branch and bound , Location problem , Computational complel(ity , Assignment problem , Communication network
Journal title :
European Journal of Operational Research
Serial Year :
1995
Journal title :
European Journal of Operational Research
Record number :
211496
Link To Document :
بازگشت