Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization pp 132–149Cite as

Quadratic knapsack problems

  • Chapter
  • First Online:

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

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.L. Balinski, “Fixed cost transportation problems”, Naval Research Logistics Quarterly 11 (1961) 41–54.

    Article  MathSciNet  Google Scholar 

  2. M.L. Balinski, “On a selection problem”, Management Science 17 (3) (1970) 230–231.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  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.

    Article  MATH  Google Scholar 

  5. P.L. Hammer and P. Hansen “Quadratic 0–1 programming”, discussion paper No. 7129, CORE. (Heverlee, 1972).

    Google Scholar 

  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.

    MATH  MathSciNet  Google Scholar 

  7. R.M. Karp, “Reducibility among combinatorial problems”, technical report 3. Computer Science University of California (Berkeley, CA, 1972).

    Google Scholar 

  8. A. Land, personal communication (1975).

    Google Scholar 

  9. D.J. Laughhunn, “Quadratic binary programming with applications to capical budgeting problems”, Operations Research 18 (1970) 454–461.

    Article  MATH  Google Scholar 

  10. C.C. Petersen, “A capital budgeting heuristic algorithm using exchange operations”, AIIE Transactions 6 (1974) 143–150.

    Google Scholar 

  11. J. Rhys, “A selection problem of shared fixed costs and network flows”, Management Science 17 (3) (1970) 200–207.

    Article  MATH  Google Scholar 

  12. H. Salkin and C.A. de Kluyver, “The knapsack problem: a survey”, Naval Research Logistics Quarterly 22 (1) (1975) 127–144.

    Article  MATH  MathSciNet  Google Scholar 

  13. H.A. Taha, “Concave minimization over a convex polyhedron”, Naval Research Logistics Quarterly 20 (1973) 533–548.

    Article  MATH  MathSciNet  Google Scholar 

  14. C. Witzgall, “Mathematical methods of site selection for Electronic Message Systems (EMS)”, NBS internal report (1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto M. Picone per le Applicazioni del Calcolo, CNR, Roma, Italy

    G. Gallo

  2. University of Waterloo, Waterloo, Ont., Canada

    P. L. Hammer & B. Simeone

Authors
  1. G. Gallo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. L. Hammer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. Simeone
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. W. Padberg

Rights and permissions

Reprints and permissions

Copyright information

© 1980 The Mathematical Programming Society

About this chapter

Cite this chapter

Gallo, G., Hammer, P.L., Simeone, B. (1980). Quadratic knapsack problems. In: Padberg, M.W. (eds) Combinatorial Optimization. Mathematical Programming Studies, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120892

Download citation

  • DOI: https://doi.org/10.1007/BFb0120892

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00801-6

  • Online ISBN: 978-3-642-00802-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation