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

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 335; s. 52 - 68
Hlavný autor:	Djeumou Fomeni, Franklin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.08.2023
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!