Login / Signup
A generalization of obligation rules for minimum cost spanning tree problems.
Gustavo Bergantiños
Leticia Lorenzo
Silvia Lorenzo-Freire
Published in:
Eur. J. Oper. Res. (2011)
Keyphrases
</>
minimum cost
spanning tree
np hard
network flow problem
minimum cost flow
approximation algorithms
minimum spanning tree
network flow
linear relaxation
minimum weight
undirected graph
minimum spanning trees
network simplex algorithm
minimum cost path
special case
network design problem
tabu search
np complete