A non-cooperative approach to the folk rule in minimum cost spanning tree problems.
Penélope HernándezJosep E. PerisJuan J. Vidal-PugaPublished in: Eur. J. Oper. Res. (2023)
Keyphrases
- minimum cost
- spanning tree
- minimum cost flow
- np hard
- network flow problem
- approximation algorithms
- minimum spanning tree
- linear relaxation
- network flow
- capacity constraints
- np complete
- minimum weight
- minimum spanning trees
- network simplex algorithm
- optimization problems
- minimum cost path
- edit operations
- minimum total cost