A continuous knapsack problem with separable convex utilities: approximation algorithms and applications

DOI10.1016/j.orl.2014.06.007zbMath1408.90236OpenAlexW2014684545MaRDI QIDQ1785255

Retsef Levi, Gonzalo Romero, Georgia Perakis

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2014.06.007

zbMATH Keywords

knapsackCournot competitionsubsidies

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Special types of economic markets (including Cournot, Bertrand) (91B54)

Related Items (2)

A fragile multi-CPR game ⋮ Robust inventory problem with budgeted cumulative demand uncertainty

Cites Work

• Allocating procurement to capacitated suppliers with concave quantity discounts
• A note on maximizing a submodular set function subject to a knapsack constraint
• The nonlinear knapsack problem - algorithms and applications
• The budgeted maximum coverage problem
• On the solution of concave knapsack problems
• The Design of Approximation Algorithms
• Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
• Reducibility among Combinatorial Problems
• Computationally Related Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A continuous knapsack problem with separable convex utilities: approximation algorithms and applications