An approximation algorithm for Stackelberg network pricing
From MaRDI portal
Recommendations
Cites work
Cited in
(39)- A tabu search algorithm for the network pricing problem
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
- Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
- An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model
- Stackelberg network pricing games
- An overview of Stackelberg pricing in networks
- A smoothing heuristic for a bilevel pricing problem
- Negative prices in network pricing games
- Stackelberg bipartite vertex cover and the preflow algorithm
- A polyhedral study of the network pricing problem with connected toll arcs
- Stackelberg network pricing is hard to approximate
- Logit network pricing
- Pricing geometric transportation networks
- An exact algorithm for the network pricing problem
- On Stackelberg pricing with computationally bounded customers
- Specializations and generalizations of the Stackelberg minimum spanning tree game
- Bilevel optimization: theory, algorithms, applications and a bibliography
- On the Complexity of Stackelberg Matroid Pricing Problems
- A Catalog of Formulations for the Network Pricing Problem
- Approximation algorithms for pricing with negative network externalities
- A bilevel programming model for a cohesive decision-making on strategic pricing and production distribution planning for a small-scale supplier
- Optimal pricing of capacitated networks
- A Competitive Network Design Problem with Pricing
- Pricing bridges to cross a river
- Posted price profit maximization for multicast by approximating fixed points
- A sublogarithmic approximation for tollbooth pricing on trees
- Stackelberg Max Closure with Multiple Followers
- Bilevel programming and price setting problems
- Bilevel programming and price setting problems
- Stackelberg packing games
- Computational comparisons of different formulations for the Stackelberg minimum spanning tree game
- A survey on mixed-integer programming techniques in bilevel optimization
- Bilevel Programming: The Montreal School
- The Stackelberg minimum spanning tree game
- An Approximation Algorithm for Stackelberg Network Pricing
- Asymmetry in the complexity of the multi-commodity network pricing problem
- Valid inequalities and branch-and-cut for the clique pricing problem
- A hybrid approach to the solution of a pricing model with continuous demand segmentation
- New formulations and valid inequalities for a bilevel pricing problem
This page was built for publication: An approximation algorithm for Stackelberg network pricing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5318277)
