A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem

The Quadratic Knapsack Problem (QKP) is a well-known combinatorial optimization problem which amounts to maximizing a quadratic function of binary variables, subject to a single linear constraint. It has many applications in finance, logistics, telecommunications, facility location, etc. The QKP is...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 335; pp. 52 - 68
Main Author:	Djeumou Fomeni, Franklin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.08.2023
Subjects:	Binary quadratic optimization Dynamic programming Integer programming Knapsack problems Local search Integer programming Local search Knapsack problems Binary quadratic optimization Dynamic programming
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!