Combinatorial Optimization pp 132-149

Part of the Mathematical Programming Studies book series (MATHPROGRAMM, volume 12)

Quadratic knapsack problems

  • G. Gallo
  • P. L. Hammer
  • B. Simeone
Chapter

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.

Key words

Knapsack Problem Quadratic Programming Upper Planes Branch-and-Bound Computation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M.L. Balinski, “Fixed cost transportation problems”, Naval Research Logistics Quarterly 11 (1961) 41–54.CrossRefMathSciNetGoogle Scholar
  2. [2]
    M.L. Balinski, “On a selection problem”, Management Science 17 (3) (1970) 230–231.MATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    E.M.L. Beale, “An algorithm for solving the transportation problem when the shipping cost over each route is convex”, Naval Research Logistics Quarterly 6 (1959) 43–56.CrossRefMathSciNetGoogle Scholar
  4. [4]
    V.A. Cabot and R. Francis, “Solving certain non-convex quadratic minimization problems by ranking the extreme points”, Operations Research 18 (1970) 82–86.MATHCrossRefGoogle Scholar
  5. [5]
    P.L. Hammer and P. Hansen “Quadratic 0–1 programming”, discussion paper No. 7129, CORE. (Heverlee, 1972).Google Scholar
  6. [6]
    P.L. Hammer, M. Padberg and U.N. Peled, “Constraint pairing in integer programming”. INFOR. Canadian Journal of Operational Research and Information Processing 13 (1975) 68–81.MATHMathSciNetGoogle Scholar
  7. [7]
    R.M. Karp, “Reducibility among combinatorial problems”, technical report 3. Computer Science University of California (Berkeley, CA, 1972).Google Scholar
  8. [8]
    A. Land, personal communication (1975).Google Scholar
  9. [9]
    D.J. Laughhunn, “Quadratic binary programming with applications to capical budgeting problems”, Operations Research 18 (1970) 454–461.MATHCrossRefGoogle Scholar
  10. [10]
    C.C. Petersen, “A capital budgeting heuristic algorithm using exchange operations”, AIIE Transactions 6 (1974) 143–150.Google Scholar
  11. [11]
    J. Rhys, “A selection problem of shared fixed costs and network flows”, Management Science 17 (3) (1970) 200–207.MATHCrossRefGoogle Scholar
  12. [12]
    H. Salkin and C.A. de Kluyver, “The knapsack problem: a survey”, Naval Research Logistics Quarterly 22 (1) (1975) 127–144.MATHCrossRefMathSciNetGoogle Scholar
  13. [13]
    H.A. Taha, “Concave minimization over a convex polyhedron”, Naval Research Logistics Quarterly 20 (1973) 533–548.MATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    C. Witzgall, “Mathematical methods of site selection for Electronic Message Systems (EMS)”, NBS internal report (1975).Google Scholar

Copyright information

© The Mathematical Programming Society 1980

Authors and Affiliations

  • G. Gallo
    • 1
  • P. L. Hammer
    • 2
  • B. Simeone
    • 2
  1. 1.Istituto M. Picone per le Applicazioni del CalcoloCNRRomaItaly
  2. 2.University of WaterlooWaterlooCanada

Personalised recommendations