Approximation and Online Algorithms
From MaRDI portal
Publication:5713432
DOI10.1007/B106130zbMATH Open1124.90302OpenAlexW4299357393MaRDI QIDQ5713432FDOQ5713432
Marc Uetz, Anton F. Kraaij, Mustapha Bouhtou, Stan Hoesel, Alexander Grigoriev
Publication date: 14 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106130
Deterministic network models in operations research (90B10) Hierarchical games (including Stackelberg games) (91A65)
Cited In (9)
- New formulations and valid inequalities for a bilevel pricing problem
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- 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
- Pricing bridges to cross a river
- Valid inequalities and branch-and-cut for the clique pricing problem
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
Recommendations
- An exact algorithm for the network pricing problem π π
- Pricing bridges to cross a river π π
- Optimal Pricing in Networks with Externalities π π
- Network flow problems with pricing decisions π π
- Optimal pricing of capacitated networks π π
- Approximate pricing in networks: How to boost the betweenness and revenue of a node π π
- Optimal static pricing for a tree network π π
- Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators π π
- A Competitive Network Design Problem with Pricing π π
- Pricing traffic in a spanning network π π
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)