A Projection Method for the Integer Quadratic Knapsack Problem

DOI10.1057/jors.1996.44zbMath0852.90109OpenAlexW2066921519MaRDI QIDQ4887719

Bala Shetty, Kurt M. Bretthauer, Siddhartha S. Syam

Publication date: 5 August 1996

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

Full work available at URL: https://doi.org/10.1057/jors.1996.44

zbMATH Keywords

branch-and-bound algorithminteger quadratic knapsack problems

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20)

Related Items (12)

Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ Variable fixing algorithms for the continuous quadratic Knapsack problem ⋮ A unified method for a class of convex separable nonlinear knapsack problems ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Breakpoint searching algorithms for the continuous quadratic knapsack problem ⋮ HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM ⋮ A relaxed projection method for general integer quadratic knapsack problem. ⋮ A breakpoint search approach for convex resource allocation problems with bounded variables ⋮ A pegging algorithm for the nonlinear resource allocation problem ⋮ Variable fixing method by weighted average for the continuous quadratic knapsack problem ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem

This page was built for publication: A Projection Method for the Integer Quadratic Knapsack Problem