Pages that link to "Item:Q5925163"
From MaRDI portal
The following pages link to Bilevel programming and price setting problems (Q5925163):
Displaying 12 items.
- A study of general and security Stackelberg game formulations (Q1999631) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
- Portfolio problems with two levels decision-makers: optimal portfolio selection with pricing decisions on transaction costs (Q2178096) (← links)
- Leadership in singleton congestion games: what is hard and what is easy (Q2289020) (← links)
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games (Q2308184) (← links)
- Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case (Q2309467) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- On the Complexity of Stackelberg Matroid Pricing Problems (Q5041182) (← links)
- Stackelberg packing games (Q5925607) (← links)
- A survey on bilevel optimization under uncertainty (Q6096565) (← links)
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs (Q6589745) (← links)
