Pages that link to "Item:Q3638879"
From MaRDI portal
The following pages link to On Hardness of Pricing Items for Single-Minded Bidders (Q3638879):
Displayed 8 items.
- An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph (Q477619) (← links)
- On the complexity of the highway problem (Q690481) (← links)
- Graph pricing with limited supply (Q832882) (← links)
- The envy-free pricing problem, unit-demand markets and connections with the network pricing problem (Q1751179) (← links)
- Models and algorithms for the product pricing with single-minded customers requesting bundles (Q2027005) (← links)
- On the approximability of digraph ordering (Q2408167) (← links)
- Pricing loss leaders can be hard (Q2637290) (← links)
- (Q5743433) (← links)