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

DOI10.1080/02331938608843180zbMATH Open0617.90067OpenAlexW2048876360MaRDI QIDQ3754439FDOQ3754439

Authors:

Publication date: 1986

Published in: Optimization (Search for Journal in Brave)

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

Recommendations

• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
• A branch-and-bound algorithm for the quadratic multiple knapsack problem
• Linear programming for the \(0-1\) quadratic knapsack problem
• A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
• 0-1 quadratic knapsack problems: an exact approach based on a \(t\)-linearization

zbMATH Keywords

branch and boundquadratic knapsack problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

• Linear Reformulations of Integer Quadratic Programs
• Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
• A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization
• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
• A Projection Method for the Integer Quadratic Knapsack Problem
• Extending the QCR method to general mixed-integer programs
• A hybrid method for solving nonlinear knapsack problems
• The efficiency enhanced branch and bound algorithm for the knapsack model
• A new upper bound for the 0-1 quadratic knapsack problem
• A simple procedure for solving a continuous quadratic mathematical model.
• Linear programming for the \(0-1\) quadratic knapsack problem
• A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem

This page was built for publication: A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3754439)