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

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 323; no. 2; pp. 425 - 440
Main Authors:	Hochbaum, D.S., Baumann, P., Goldschmidt, O., Zhang, Y.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.06.2025
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!