Skip to main content
Book Chapter

The Quadratic Knapsack Problem

  • Kellerer H
  • Pferschy U
  • Pisinger D
Springer Berlin Heidelberg, (2004), 349-388
DOI: 10.1007/978-3-540-24777-7_12
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Kellerer, H., Pferschy, U., & Pisinger, D. (2004). The Quadratic Knapsack Problem. In Knapsack Problems (pp. 349–388). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24777-7_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free