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.
References
M.L. Balinski, “Fixed cost transportation problems”, Naval Research Logistics Quarterly 11 (1961) 41–54.
M.L. Balinski, “On a selection problem”, Management Science 17 (3) (1970) 230–231.
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.
V.A. Cabot and R. Francis, “Solving certain non-convex quadratic minimization problems by ranking the extreme points”, Operations Research 18 (1970) 82–86.
P.L. Hammer and P. Hansen “Quadratic 0–1 programming”, discussion paper No. 7129, CORE. (Heverlee, 1972).
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.
R.M. Karp, “Reducibility among combinatorial problems”, technical report 3. Computer Science University of California (Berkeley, CA, 1972).
A. Land, personal communication (1975).
D.J. Laughhunn, “Quadratic binary programming with applications to capical budgeting problems”, Operations Research 18 (1970) 454–461.
C.C. Petersen, “A capital budgeting heuristic algorithm using exchange operations”, AIIE Transactions 6 (1974) 143–150.
J. Rhys, “A selection problem of shared fixed costs and network flows”, Management Science 17 (3) (1970) 200–207.
H. Salkin and C.A. de Kluyver, “The knapsack problem: a survey”, Naval Research Logistics Quarterly 22 (1) (1975) 127–144.
H.A. Taha, “Concave minimization over a convex polyhedron”, Naval Research Logistics Quarterly 20 (1973) 533–548.
C. Witzgall, “Mathematical methods of site selection for Electronic Message Systems (EMS)”, NBS internal report (1975).
Author information
Authors and Affiliations
Editor information
Rights 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