A cut-and-branch algorithm for the quadratic knapsack problem

Djeumou Fomeni, Franklin and Kaparis, Konstantinos and Letchford, Adam (2022) A cut-and-branch algorithm for the quadratic knapsack problem. Discrete Optimization, 44 (2): 100579. ISSN 1572-5286

[thumbnail of qkp2]
Text (qkp2)
qkp2.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.

Download (455kB)


The Quadratic Knapsack Problem (QKP) is a well-known NP-hard combinatorial optimisation problem, with many practical applications. We present a ‘cut-and-branch’ algorithm for the QKP, in which a cutting-plane phase is followed by a branch-and-bound phase. The cutting-plane phase is more sophisticated than the existing ones in the literature, incorporating several classes of cutting planes, two primal heuristics, and several rules for eliminating variables and constraints. Computational results show that the algorithm is competitive.

Item Type:
Journal Article
Journal or Publication Title:
Discrete Optimization
Additional Information:
This is the author’s version of a work that was accepted for publication in Discrete Optimization. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Discrete Optimization, 44, 2, 2022 DOI: 10.1016/j.disopt.2020.100579
Uncontrolled Keywords:
?? integer programmingcombinatorial optimisationknapsack problemscomputational theory and mathematicstheoretical computer scienceapplied mathematics ??
ID Code:
Deposited By:
Deposited On:
24 Feb 2020 16:25
Last Modified:
21 Jun 2024 01:17