The Stackelberg Minimum Spanning Tree Game
From MaRDI portal
Publication:3603515
Recommendations
- The Stackelberg minimum spanning tree game
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
- Specializations and generalizations of the Stackelberg minimum spanning tree game
- A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game
- Stackelberg network pricing games
Cited in
(15)- The minimum cost spanning forest game
- Three-person spanning tree games
- The Stackelberg minimum spanning tree game
- Stackelberg shortest path tree game, revisited
- A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game
- On the complexity of the bilevel minimum spanning tree problem
- Specializations and generalizations of the Stackelberg minimum spanning tree game
- Stackelberg network pricing games
- Efficient heuristic algorithms for maximum utility product pricing problems
- The price of imperfect competition for a spanning network
- Stackelberg network pricing is hard to approximate
- Pricing Tree Access Networks with Connected Backbones
- Bilevel optimization: theory, algorithms, applications and a bibliography
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
- Spanning-tree games
This page was built for publication: The Stackelberg Minimum Spanning Tree Game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603515)