New algorithm for quadratic integer knapsack problems

DOI10.3969/J.ISSN.1006-6330.2015.03.003zbMATH Open1349.90637MaRDI QIDQ2994046FDOQ2994046

Authors: Wenhao Sun, Wei Chen 

Publication date: 10 August 2016

Recommendations

• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
• Integer quadratic knapsack problems
• A lifted-space dynamic programming algorithm for the quadratic knapsack problem
• A cut-and-branch algorithm for the quadratic knapsack problem
• A Projection Method for the Integer Quadratic Knapsack Problem

zbMATH Keywords

global optimizationinteger programmingbranch-and-boundquadratic knapsack problemdomination tuple

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10)

Cited In (8)

• A New Algorithm for the Solution of the Knapsack Problem
• Integer quadratic knapsack problems
• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
• A Projection Method for the Integer Quadratic Knapsack Problem
• A Newton's method for the continuous quadratic knapsack problem
• A cut-and-branch algorithm for the quadratic knapsack problem
• A logarithmic descent direction algorithm for the quadratic knapsack problem
• A lifted-space dynamic programming algorithm for the quadratic knapsack problem

This page was built for publication: New algorithm for quadratic integer knapsack problems

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