A unified method for a class of convex separable nonlinear knapsack problems
type: Item
instance of: scholarly article
title: A unified method for a class of convex separable nonlinear knapsack problems
zbMATH Open document ID: 1146.90051
author: Bin Zhang
author: Zhong-Sheng Hua
published in: European Journal of Operational Research
publication date: 2008-06-24T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 5292261
zbMATH Keywords: nonlinear knapsack problem
zbMATH Keywords: convex programming
zbMATH Keywords: separable programming
zbMATH Keywords: singly constrained program
MaRDI profile type: Publication
full work available at URL: j.ejor.2007.07.005
OpenAlex ID: W1972011204
cites work: Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
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: Nonlinear integer programming for optimal allocation in stratified sampling
cites work: A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
cites work: A Projection Method for the Integer Quadratic Knapsack Problem
cites work: Q5343971
cites work: Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
cites work: A variable-grouping based genetic algorithm for large-scale integer programming
cites work: An approximate dynamic programming approach to convex quadratic knapsack problems
cites work: Algorithms for separable nonlinear resource allocation problems
cites work: Technical Note—Allocation of Effort Resources among Competing Activities
cites work: Algorithms for bound constrained quadratic programming problems
cites work: Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
cites work: On the continuous quadratic knapsack problem
cites work: Convex separable minimization subject to bounded variables
cites work: Simple Ranking Methods for Allocation of One Resource
DOI: 10.1016/J.EJOR.2007.07.005
Recommended article: A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
Recommended article: An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
Recommended article: On a nonseparable convex maximization problem with continuous Knapsack constraints
Recommended article: A Solution Strategy for a Class of Nonlinear Knapsack Problems
Recommended article: Nonconvex piecewise linear knapsack problems
Recommended article: A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
Recommended article: On a discrete nonlinear and nonseparable knapsack problem
Recommended article: HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
Recommended article: A penalty algorithm for solving convex separable knapsack problems
description: scientific article; zbMATH DE number 5292261