Pages that link to "Item:Q2482810"

The following pages link to An overview of Stackelberg pricing in networks (Q2482810):

Displaying 17 items.

• Stackelberg bipartite vertex cover and the preflow algorithm (Q270027) (← links)
• Joint optimization for coordinated configuration of product families and supply chains by a leader-follower Stackelberg game (Q319756) (← links)
• Logit network pricing (Q336811) (← links)
• Specializations and generalizations of the Stackelberg minimum spanning tree game (Q476917) (← links)
• The Stackelberg minimum spanning tree game (Q627533) (← links)
• Highway toll pricing (Q1926795) (← 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)
• An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model (Q2116857) (← links)
• Stackelberg network pricing games (Q2429327) (← links)
• Negative prices in network pricing games (Q2670481) (← links)
• Pricing Toll Roads under Uncertainty (Q5240222) (← links)
• Stackelberg Max Closure with Multiple Followers (Q5870364) (← links)
• On the complexity of the bilevel minimum spanning tree problem (Q6064168) (← 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)