A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems

DOI10.1287/ijoc.7.1.109zbMath0822.90105OpenAlexW2091971915MaRDI QIDQ4835455

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

Publication date: 1 June 1995

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.7.1.109

zbMATH Keywords

branch and boundlower and upper boundsreoptimizationseparable convex quadratic knapsack

Mathematics Subject Classification ID

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

Related Items (22)

A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming ⋮ Decision model and analysis for investment interest expense deduction and allocation ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ A nonlinear knapsack problem ⋮ A penalty algorithm for solving convex separable knapsack problems ⋮ The quadratic knapsack problem -- a survey ⋮ A Newton's method for the continuous quadratic knapsack problem ⋮ Variable fixing algorithms for the continuous quadratic Knapsack problem ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ 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 ⋮ On linear-time 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. ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ Capacity-constrained multiple-market price discrimination ⋮ A Lagrangian relaxation approach to the edge-weighted clique problem ⋮ A pegging algorithm for the nonlinear resource allocation problem ⋮ Variable fixing method by weighted average for the continuous quadratic knapsack problem ⋮ An approximate dynamic programming approach to convex quadratic knapsack problems ⋮ The nonlinear knapsack problem - algorithms and applications

This page was built for publication: A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems