Folk solution for simple minimum cost spanning tree problems.
Begoña SubizaJosé-Manuel Giménez-GómezJosep E. PerisPublished in: Oper. Res. Lett. (2016)
Keyphrases
- minimum cost
- spanning tree
- network flow problem
- linear relaxation
- np hard
- minimum cost flow
- approximation algorithms
- network flow
- minimum spanning tree
- undirected graph
- capacity constraints
- minimum spanning trees
- network simplex algorithm
- minimum weight
- edge weights
- exact solution
- network design problem
- optimization problems
- bayesian networks
- integer program
- np complete
- upper bound
- minimum total cost
- minimum cost path