Pages that link to "Item:Q1945700"
From MaRDI portal
The following pages link to The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700):
Displaying 10 items.
- A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game (Q325472) (← links)
- Specializations and generalizations of the Stackelberg minimum spanning tree game (Q476917) (← links)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
- Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting (Q2020618) (← links)
- Stackelberg network pricing games (Q2429327) (← links)
- On stackelberg pricing with computationally bounded customers (Q4648689) (← links)
- Spanning-Tree Games. (Q5005136) (← links)
- On the Complexity of Stackelberg Matroid Pricing Problems (Q5041182) (← links)
- Stackelberg packing games (Q5925607) (← links)
- Computational comparisons of different formulations for the Stackelberg minimum spanning tree game (Q6070408) (← links)
