A branch and search algorithm for a class of nonlinear knapsack problems

Authors:
Kamlesh Mathur;Harvey M. Salkin;Susumu Morito
Affiliations:
Department of Operations Research, Weatherhead School of Management, Case Western Reserve University, Cleveland, OH 44106, USA;Department of Operations Research, Weatherhead School of Management, Case Western Reserve University, Cleveland, OH 44106, USA;Tsukuba University, Ibaraki, Japan
Venue:
Operations Research Letters
Year:
1983

Citing 0
Cited 6

An approximate dynamic programming approach to convex quadratic knapsack problems

Computers and Operations Research
A nonlinear Knapsack problem

Operations Research Letters
Quadratic resource allocation with generalized upper bounds

Operations Research Letters
Exact solution of a class of nonlinear knapsack problems

Operations Research Letters
A note on a general non-linear knapsack problem

Operations Research Letters
A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses a class of nonlinear knapsack problems where the objective function is quadratic. The method is a branch and search procedure which includes an efficient algorithm to find the continuous (relaxed) solution and a reduction rule which computes tight lower and upper bounds on the integer variables.