On the complexity of a bundle pricing problem

DOI10.1007/s10288-011-0154-zzbMath1230.91055OpenAlexW2168139487WikidataQ57338952 ScholiaQ57338952MaRDI QIDQ657580

Marc Uetz, Alexander Grigoriev, Joyce van Loon

Publication date: 10 January 2012

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-011-0154-z

zbMATH Keywords

computational complexityapproximation algorithmpricing problems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Microeconomic theory (price theory and economic markets) (91B24)

Cites Work

• Unnamed Item
• Optimal bundle pricing with monotonicity constraint
• Combination Can Be Hard: Approximability of the Unique Coverage Problem
• On the Complexity of the Highway Pricing Problem
• Optimal pricing of capacitated networks
• Algorithms and Data Structures
• Pricing bridges to cross a river

This page was built for publication: On the complexity of a bundle pricing problem