Approximation and Online Algorithms
From MaRDI portal
Publication:5713432
Recommendations
- Pricing bridges to cross a river
- Network flow problems with pricing decisions
- A Competitive Network Design Problem with Pricing
- Optimal pricing in networks with externalities
- Pricing traffic in a spanning network
- Network pricing: how to induce optimal flows under strategic link operators
- Optimal pricing of capacitated networks
- Approximate pricing in networks: How to boost the betweenness and revenue of a node
- An exact algorithm for the network pricing problem
- Optimal static pricing for a tree network
Cited in
(16)- An approximation algorithm for Stackelberg network pricing
- New formulations and valid inequalities for a bilevel pricing problem
- Pricing geometric transportation networks
- A continuous optimization model for a joint problem of pricing and resource allocation
- A hybrid approach to the solution of a pricing model with continuous demand segmentation
- An exact algorithm for the network pricing problem
- Specializations and generalizations of the Stackelberg minimum spanning tree game
- An overview of Stackelberg pricing in networks
- Pricing bridges to cross a river
- Valid inequalities and branch-and-cut for the clique pricing problem
- Optimal static pricing for a tree network
- Stackelberg network pricing is hard to approximate
- Pricing Tree Access Networks with Connected Backbones
- Optimal pricing of capacitated networks
- Bilevel optimization: theory, algorithms, applications and a bibliography
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
This page was built for publication: Approximation and Online Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713432)
