Solving knapsack problems with \(S\)-curve return functions
type: Item
instance of: scholarly article
title: Solving knapsack problems with \(S\)-curve return functions
zbMATH Open document ID: 1165.90598
author: Semra Ağralı
author: Joseph Geunes
published in: European Journal of Operational Research
publication date: 2008-12-02T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 91B28
zbMATH DE Number: 5376972
zbMATH Keywords: non-linear programming
zbMATH Keywords: OR in strategic planning
zbMATH Keywords: dynamic programming
zbMATH Keywords: marketing
MaRDI profile type: Publication
full work available at URL: j.ejor.2007.10.060
OpenAlex ID: W2083571976
cites work: Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing
cites work: Nonlinear Programming
cites work: Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
cites work: The Nonlinear Resource Allocation Problem
cites work: A pegging algorithm for the nonlinear resource allocation problem
cites work: The nonlinear knapsack problem - algorithms and applications
cites work: Allocating procurement to capacitated suppliers with concave quantity discounts
cites work: S-Shaped Response Functions: Implications for Decision Models
cites work: On optimality conditions in nondifferentiable programming
cites work: A nonlinear knapsack problem
cites work: Introduction to global optimization
cites work: Algorithms for separable nonlinear resource allocation problems
cites work: Technical Note—Allocation of Effort Resources among Competing Activities
cites work: Q3993418
cites work: A branch and search algorithm for a class of nonlinear knapsack problems
cites work: On the solution of concave knapsack problems
cites work: An Algorithm for Nonlinear Knapsack Problems
cites work: On optimal allocation of indivisibles under uncertainty
cites work: On a nonseparable convex maximization problem with continuous Knapsack constraints
cites work: The stochastic transportation problem with single sourcing
cites work: Exact algorithm for concave knapsack problems: linear underestimation and partition method
cites work: Monotonic optimization: Problems and solution approaches
cites work: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
cites work: Simple Ranking Methods for Allocation of One Resource
cites work: Integer Programming Models for Sales Resource Allocation
cites work: An Optimal Algorithm for Sales Representative Time Management
DOI: 10.1016/J.EJOR.2007.10.060
description: scientific article; zbMATH DE number 5376972