A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem

The Quadratic Knapsack Problem (QKP) involves selecting a subset of elements that maximizes the sum of pairwise and singleton utilities without exceeding a given budget. The pairwise utilities are nonnegative, the singleton utilities may be positive, negative, or zero, and the node costs are nonnega...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 323; číslo 2; s. 425 - 440
Hlavní autori:	Hochbaum, D.S., Baumann, P., Goldschmidt, O., Zhang, Y.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.06.2025
Predmet:	Breakpoints algorithm Combinatorial optimization Greedy algorithm Parametric cut Quadratic Knapsack problem Greedy algorithm Parametric cut Quadratic Knapsack problem Breakpoints algorithm Combinatorial optimization
ISSN:	0377-2217
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!