Please use this identifier to cite or link to this item:
https://ruomo.lib.uom.gr/handle/7000/1803
Title: | A cut-and-branch algorithm for the Quadratic Knapsack Problem |
Authors: | Djeumou Fomeni, Franklin Kaparis, Konstantinos Letchford, Adam N. |
Type: | Article |
Subjects: | FRASCATI::Natural sciences::Computer and information sciences |
Keywords: | Knapsack problems Cutting planes Integer programming |
Issue Date: | 2022 |
Source: | Discrete Optimization |
Volume: | 44 |
First Page: | 100579 |
Abstract: | 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. |
URI: | https://doi.org/10.1016/j.disopt.2020.100579 https://ruomo.lib.uom.gr/handle/7000/1803 |
ISSN: | 1572-5286 |
Other Identifiers: | 10.1016/j.disopt.2020.100579 |
Appears in Collections: | Department of Business Administration |
This item is licensed under a Creative Commons License