Pages that link to "Item:Q3082599"
From MaRDI portal
The following pages link to Stackelberg network pricing is hard to approximate (Q3082599):
Displaying 10 items.
- Stackelberg bipartite vertex cover and the preflow algorithm (Q270027) (← links)
- Specializations and generalizations of the Stackelberg minimum spanning tree game (Q476917) (← links)
- Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting (Q2020618) (← links)
- Negative prices in network pricing games (Q2670481) (← links)
- On the Complexity of Stackelberg Matroid Pricing Problems (Q5041182) (← links)
- Stackelberg Max Closure with Multiple Followers (Q5870364) (← links)
- Bilevel programming and price setting problems (Q5917900) (← links)
- Bilevel programming and price setting problems (Q5925163) (← links)
- Stackelberg packing games (Q5925607) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
