A relaxed projection method for general integer quadratic knapsack problem.

DOI10.1007/BF03398839zbMath1151.90497OpenAlexW2771430001MaRDI QIDQ2477123

Shifali Bhargava, K. C. Sharma

Publication date: 13 March 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398839

zbMATH Keywords

integer programmingquadratic knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• On the continuous quadratic knapsack problem
• A Parallel Projection for the Multicommodity Network Model
• A polynomially bounded algorithm for a singly constrained quadratic program
• Massively Parallel Algorithms for Singly Constrained Convex Programs
• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
• A Projection Method for the Integer Quadratic Knapsack Problem

This page was built for publication: A relaxed projection method for general integer quadratic knapsack problem.