HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM

DOI10.1142/S0217595912500315zbMath1251.90285MaRDI QIDQ4649881

Bin Zhang, Bo Chen

Publication date: 15 November 2012

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

integer programmingconvex programmingbranch and bound methodquadratic knapsacknonlinear knapsack problem

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items (4)

Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ Relaxations and heuristics for the multiple non-linear separable knapsack problem ⋮ Integer knapsack problems with profit functions of the same value range ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem

Uses Software

• Knapsack

Cites Work

• The quadratic knapsack problem -- a survey
• A unified method for a class of convex separable nonlinear knapsack problems
• Multi-product newsboy problem with limited capacity and outsourcing
• Min-cut clustering
• The nonlinear knapsack problem - algorithms and applications
• Nonlinear integer programming for optimal allocation in stratified sampling
• Capacity-constrained multiple-market price discrimination
• A nonlinear knapsack problem
• A new variable reduction technique for convex integer quadratic programs
• Nonlinear integer programming
• An approximate dynamic programming approach to convex quadratic knapsack problems
• Algorithms for Separable Nonlinear Resource Allocation Problems
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
• A Projection Method for the Integer Quadratic Knapsack Problem
• The Nonlinear Resource Allocation Problem
• Convex separable minimization subject to bounded variables
• A pegging algorithm for the nonlinear resource allocation problem

This page was built for publication: HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM