A cost allocation rule for k-hop minimum cost spanning tree problems.
Gustavo BergantiñosMaría Gómez-RúaNatividad LlorcaManuel A. PulidoJoaquín Sánchez-SorianoPublished in: Oper. Res. Lett. (2012)
Keyphrases
- minimum cost
- spanning tree
- minimum cost flow
- network flow problem
- np hard
- linear relaxation
- approximation algorithms
- network simplex algorithm
- minimum spanning tree
- network flow
- minimum spanning trees
- np complete
- minimum weight
- undirected graph
- capacity constraints
- weighted graph
- optimization problems
- minimum cost path
- objective function
- integer programming
- upper bound
- special case
- lowest cost
- minimum total cost
- lower bound