Solving knapsack problems with \(S\)-curve return functions

DOI10.1016/j.ejor.2007.10.060zbMath1165.90598OpenAlexW2083571976MaRDI QIDQ958108

Joseph Geunes, Semra Ağralı

Publication date: 2 December 2008

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

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

zbMATH Keywords

dynamic programmingmarketingOR in strategic planningnon-linear programming

Mathematics Subject Classification ID

Related Items (2)

Mature or emerging markets: competitive duopoly investment decisions ⋮ Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization

Cites Work

• Unnamed Item
• A branch and search algorithm for a class of nonlinear knapsack problems
• Exact algorithm for concave knapsack problems: linear underestimation and partition method
• Allocating procurement to capacitated suppliers with concave quantity discounts
• The nonlinear knapsack problem - algorithms and applications
• Introduction to global optimization
• A nonlinear knapsack problem
• The stochastic transportation problem with single sourcing
• On the solution of concave knapsack problems
• On a nonseparable convex maximization problem with continuous Knapsack constraints
• Monotonic Optimization: Problems and Solution Approaches
• Algorithms for Separable Nonlinear Resource Allocation Problems
• On Optimal Allocation of Indivisibles Under Uncertainty
• Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing
• Integer Programming Models for Sales Resource Allocation
• Simple Ranking Methods for Allocation of One Resource
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• S-Shaped Response Functions: Implications for Decision Models
• An Optimal Algorithm for Sales Representative Time Management
• Technical Note—Allocation of Effort Resources among Competing Activities
• An Algorithm for Nonlinear Knapsack Problems
• On optimality conditions in nondifferentiable programming
• The Nonlinear Resource Allocation Problem
• Nonlinear Programming
• Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
• A pegging algorithm for the nonlinear resource allocation problem

This page was built for publication: Solving knapsack problems with \(S\)-curve return functions