Title of article :
On Steiner trees and minimum spanning trees in hypergraphs
Author/Authors :
Tobias Polzin، نويسنده , , Siavash Vahdati Daneshmand، نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 2003
Pages :
9
From page :
12
To page :
20
Keywords :
Linear programming , relaxation , Steiner problem
Journal title :
Operations Research Letters
Serial Year :
2003
Journal title :
Operations Research Letters
Record number :
137393
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=137393
بازگشت