Skip to main content

Best network flow bounds for the quadratic knapsack problem

Seminars

Part of the Lecture Notes in Mathematics book series (LNMCIME,volume 1403)

Abstract

A Lagrangean relaxation of the quadratic knapsack problem is studied. It is shown, among other properties, that the best value of the Lagrangean multiplier, and hence the best bound for the original problem, can be determined in at most n−1 applications of a maximum flow algorithm to a network with n+2 vertices and n+m arcs, where n and m denote the numbers of variables and of quadratic terms. A branch-and-bound algorithm using this result is presented and computational experience is reported on.

Paper presented at the NETFLOW 83 International Workshop, Pisa, Italy, 28–31 March 1983.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. FORD L.R. and D.R. FULKERSON, Flows in networks, Princeton University Press, 1962.

    Google Scholar 

  2. GALLO G., M. GRIGORIADIS and R.E. TARJAN, “A Fast Parametric Network Flow Algorithm”, Research Report, Department of Computer Science, Rutgers University, N.J. (forthcoming).

    Google Scholar 

  3. GALLO G., P.L. HAMMER and B. SIMEONE, “Quadratic Knapsack Problem”, Math. Prog. Study 12 (1980), 132–149.

    CrossRef  Google Scholar 

  4. HAMMER P.L., “Some Network Flow Problem Solved with Pseudo-Boolean Programming”, Operations Research 13 (1965), 388–399.

    CrossRef  Google Scholar 

  5. KARZANOV A.V., “Determining the Maximum Flow in a Network by the Method of Preflows”, Soviet Math. Dokl. 15 (1974), 434–437.

    Google Scholar 

  6. MALHOTRA V.M., M.P. KUMAR and S.N. MAHESHWARI, “An O(V 3) Algorithm for Finding Maximum Flows in Networks”, Information Processing Letters 7 (1978), 277–278.

    CrossRef  Google Scholar 

  7. MAHIEU Y., Un Algorithme pour le problème du sac de campeur quadratique, Mémoire de fin d'études, Faculté Universitaire Catholique de Mons, Belgium, 1981.

    Google Scholar 

  8. MINOUX M., Programmation Mathématique, 2 Volumes, Dunod, Paris, 1983.

    Google Scholar 

  9. PICARD J.C. and M. QUEYRANNE, “Networks, Graphs and Some Non-Linear 0–1 Programming Problems”, Techn. Rep. EP77-R-32, Ecole Polytechnique de Montréal, Canada, 1977.

    Google Scholar 

  10. PICARD J.C. and H.D. RATLIFF, “Minimum Cuts and Related Problems”, Networks 5 (1975), 357–370.

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1989 Springer-Verlag

About this paper

Cite this paper

Chaillou, P., Hansen, P., Mahieu, Y. (1989). Best network flow bounds for the quadratic knapsack problem. In: Simeone, B. (eds) Combinatorial Optimization. Lecture Notes in Mathematics, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083467

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51797-9

  • Online ISBN: 978-3-540-46810-3

  • eBook Packages: Springer Book Archive