Quadratic knapsack problems
Quadratic knapsack problems
The quadratic knapsack (QK) model naturally arises in a variety of problems in operations research, statistics and combinatorics. Some “upper planes” for the QK problem are derived, and their different uses in a branch-and-bound scheme for solving such a problem are discussed. Some theoretical results concerning the class of all upper planes, as well as extensive computational experience, are reported.
Numerical mathematical programming methods, quadratic knapsack problems, upper plane, heuristic algorithm, branch-and-bound, Integer programming, linear relaxation, numerical experience, Boolean programming, Quadratic programming, randomly generated test problems, improving procedure
Numerical mathematical programming methods, quadratic knapsack problems, upper plane, heuristic algorithm, branch-and-bound, Integer programming, linear relaxation, numerical experience, Boolean programming, Quadratic programming, randomly generated test problems, improving procedure
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).140 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!