"Optimistic" weighted Shapley rules in minimum cost spanning tree problems.
Gustavo BergantiñosSilvia Lorenzo-FreirePublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- minimum cost
- spanning tree
- network flow problem
- minimum cost flow
- np hard
- approximation algorithms
- linear relaxation
- minimum spanning trees
- minimum spanning tree
- network flow
- edge weights
- undirected graph
- weighted graph
- network simplex algorithm
- special case
- capacity constraints
- minimum weight
- optimization problems
- bi objective
- weighted sum
- np complete
- total weight