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.
Key wordsKnapsack Problem Quadratic Programming Upper Planes Branch-and-Bound Computation
Unable to display preview. Download preview PDF.
- P.L. Hammer and P. Hansen “Quadratic 0–1 programming”, discussion paper No. 7129, CORE. (Heverlee, 1972).Google Scholar
- R.M. Karp, “Reducibility among combinatorial problems”, technical report 3. Computer Science University of California (Berkeley, CA, 1972).Google Scholar
- A. Land, personal communication (1975).Google Scholar
- C.C. Petersen, “A capital budgeting heuristic algorithm using exchange operations”, AIIE Transactions 6 (1974) 143–150.Google Scholar
- C. Witzgall, “Mathematical methods of site selection for Electronic Message Systems (EMS)”, NBS internal report (1975).Google Scholar