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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics Jg. 335; S. 52 - 68
1. Verfasser:	Djeumou Fomeni, Franklin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 15.08.2023
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!