Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization

DOI10.1016/J.EJOR.2013.12.035MaRDI QIDQ2356258zbMATH OpenOpenAlexFDO

Authors Vaibhav Srivastava, Francesco Bullo

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

bin-packing problemgeneralized assignment problemhuman attention allocationknapsack problemmulti-choice knapsack problemSigmoid utility/\(S\)-curve

Mathematics Subject Classification ID

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

Recommendations

• A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
• A nonlinear knapsack problem
• Nonconvex piecewise linear knapsack problems
• The nonlinear knapsack problem - algorithms and applications
• Solving knapsack problems with \(S\)-curve return functions

Cites work

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

Cited in

(6)

• An efficient topology description function method based on modified sigmoid function
• Optimal spares allocation to an exchangeable-item repair system with tolerable wait
• A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
• Lower and upper bounds for the non-linear generalized assignment problem
• A new effective dynamic program for an investment optimization problem
• Continuous equality knapsack with probit-style objectives

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

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