Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization

DOI10.1016/j.ejor.2013.12.035zbMath1317.90259OpenAlexW2164794228MaRDI QIDQ2356258

Vaibhav Srivastava, Bullo, Francesco

Publication date: 29 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.12.035

zbMATH Keywords

generalized assignment problemknapsack problembin-packing problemhuman attention allocationmulti-choice knapsack problemSigmoid utility/\(S\)-curve

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (4)

Lower and upper bounds for the non-linear generalized assignment problem ⋮ An efficient topology description function method based on modified sigmoid function ⋮ A new effective dynamic program for an investment optimization problem ⋮ Optimal spares allocation to an exchangeable-item repair system with tolerable wait

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal budget allocation when response is S-shaped
• An efficient approximation for the generalized assignment problem
• Allocating procurement to capacitated suppliers with concave quantity discounts
• Nonconvex piecewise linear knapsack problems
• Solving knapsack problems with \(S\)-curve return functions
• Global optimization of univariate Lipschitz functions. I: Survey and properties
• The nonlinear knapsack problem - algorithms and applications
• On the convergence of the P-algorithm for one-dimensional global optimization of smooth functions
• On the solution of concave knapsack problems
• Attention allocation for decision making queues
• Lagrange Multipliers and Optimality
• S-Shaped Response Functions: Implications for Decision Models
• Bidding in Simultaneous Auctions with a Constraint on Exposure
• On optimality conditions in nondifferentiable programming
• Combinatorial optimization. Theory and algorithms

This page was built for publication: Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization