A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game.
Vinicius MoraisAlexandre Salles da CunhaPhilippe MaheyPublished in: Electron. Notes Discret. Math. (2016)
Keyphrases
- minimum spanning tree
- spanning tree
- cost function
- np hard
- optimal solution
- probabilistic model
- simulated annealing
- particle swarm optimization
- segmentation algorithm
- objective function
- search space
- worst case
- energy function
- tree structure
- game theory
- traveling salesman problem
- computational complexity
- undirected graph