Pages that link to "Item:Q5713432"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5713432):
Displaying 13 items.
- An exact algorithm for the network pricing problem (Q429686) (← links)
- Specializations and generalizations of the Stackelberg minimum spanning tree game (Q476917) (← links)
- Valid inequalities and branch-and-cut for the clique pricing problem (Q665989) (← links)
- A hybrid approach to the solution of a pricing model with continuous demand segmentation (Q743631) (← links)
- New formulations and valid inequalities for a bilevel pricing problem (Q935200) (← links)
- Optimal static pricing for a tree network (Q1761804) (← links)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
- An overview of Stackelberg pricing in networks (Q2482810) (← links)
- Stackelberg network pricing is hard to approximate (Q3082599) (← links)
- A continuous optimization model for a joint problem of pricing and resource allocation (Q3632804) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- An approximation algorithm for Stackelberg network pricing (Q5318277) (← links)
- Pricing bridges to cross a river (Q5436961) (← links)
