|
Volumn 170, Issue 3, 2006, Pages 900-908
|
A new relaxation method for the generalized minimum spanning tree problem
|
Author keywords
Combinatorial optimization; Generalized minimum spanning tree problem; Minimum spanning trees
|
Indexed keywords
COMBINATORIAL MATHEMATICS;
INTEGER PROGRAMMING;
OPTIMIZATION;
PROBLEM SOLVING;
COMBINATORIAL OPTIMIZATION;
GENERALIZED MINIMUM SPANNING TREE PROBLEMS;
MINIMUM SPANNING TREES;
TREES (MATHEMATICS);
|
EID: 27744480327
PISSN: 03772217
EISSN: None
Source Type: Journal
DOI: 10.1016/j.ejor.2004.07.058 Document Type: Article |
Times cited : (32)
|
References (11)
|