A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm

DOI10.1080/02331938608843180zbMath0617.90067OpenAlexW2048876360MaRDI QIDQ3754439

No author found.

Publication date: 1986

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938608843180

zbMATH Keywords

branch and boundquadratic knapsack problem

Mathematics Subject Classification ID

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

Related Items

A hybrid method for solving nonlinear knapsack problems, Extending the QCR method to general mixed-integer programs, A new upper bound for the 0-1 quadratic knapsack problem, Linear Reformulations of Integer Quadratic Programs, Linear programming for the \(0-1\) quadratic knapsack problem

Cites Work

• An efficient branch and bound algorithm to solve the quadratic integer programming problem
• A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
• Numerical investigations on quadratic assignment problems