Pages that link to "Item:Q627533"

The following pages link to The Stackelberg minimum spanning tree game (Q627533):

Displaying 18 items.

• Stackelberg bipartite vertex cover and the preflow algorithm (Q270027) (← links)
• Backward induction algorithm for a class of closed-loop Stackelberg games (Q296624) (← links)
• A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game (Q325472) (← links)
• On bilevel machine scheduling problems (Q421065) (← 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)
• On the Stackelberg knapsack game (Q2029942) (← links)
• Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments (Q2300720) (← links)
• Negative prices in network pricing games (Q2670481) (← links)
• On stackelberg pricing with computationally bounded customers (Q4648689) (← links)
• Spanning-Tree Games. (Q5005136) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• On the Complexity of Stackelberg Matroid Pricing Problems (Q5041182) (← links)
• Network investment games with Wardrop followers (Q5092358) (← links)
• Stackelberg Max Closure with Multiple Followers (Q5870364) (← links)
• Computational comparisons of different formulations for the Stackelberg minimum spanning tree game (Q6070408) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)