In this paper we present an axiomatic characterization of the weighted Shapley value of the optimistic TU game associated with a minimum cost spanning tree problem. This characterization is based on ...

The Capacitated Minimum Spanning Tree Problem is NP-hard and several heuristic solution methods have been proposed. They can be classified as classical ones and metaheuristics. Recent developments ...