Title of article
A branch-and-bound algorithm for the mini-max spanning forest problem
Author/Authors
Takeo Yamada، نويسنده , , Hideo Takahashi، نويسنده , , Seiji Kataoka، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
11
From page
93
To page
103
Keywords
Mini-max problem , Branch-and-bound method , graph theory , Spanning forest
Journal title
European Journal of Operational Research
Serial Year
1997
Journal title
European Journal of Operational Research
Record number
212199
Link To Document