Characterizing rules in minimum cost spanning tree problems.
Lingsheng ShiBoya YuPublished in: Oper. Res. Lett. (2017)
Keyphrases
- minimum cost
- spanning tree
- network flow problem
- np hard
- minimum cost flow
- linear relaxation
- approximation algorithms
- minimum spanning tree
- minimum spanning trees
- network flow
- minimum weight
- undirected graph
- capacity constraints
- network simplex algorithm
- optimization problems
- np complete
- minimum total cost
- network design problem
- evolutionary algorithm
- search algorithm