Cost additive rules in minimum cost spanning tree problems with multiple sources.
Gustavo BergantiñosLeticia LorenzoPublished in: Ann. Oper. Res. (2021)
Keyphrases
- minimum cost
- spanning tree
- multiple sources
- network flow problem
- minimum cost flow
- np hard
- approximation algorithms
- network flow
- minimum spanning tree
- capacity constraints
- minimum cost path
- network simplex algorithm
- undirected graph
- data sets
- data sources
- databases
- integer programming
- edge weights
- collaborative filtering
- dynamic programming
- viewpoint
- minimum spanning trees
- lowest cost
- database