On multi-demand knapsack pricing

zbMATH Open1183.90338MaRDI QIDQ3405002FDOQ3405002

Authors: Ling Gai, Lichun Zhao 

Publication date: 12 February 2010

Recommendations

• On revenue maximization with sharp multi-unit demands
• Revenue maximization in the dynamic knapsack problem
• Envy-Free Pricing in Multi-item Markets
• On profit-maximizing envy-free pricing
• Envy-free pricing in multi-item markets

zbMATH Keywords

combinatorial optimizationknapsack problempacking algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) General biology and biomathematics (92B05)

This page was built for publication: On multi-demand knapsack pricing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3405002)