Skip to main content
SpringerLink
Log in

Shortest path algorithms for knapsack type problems

  • Published:
Mathematical Programming Submit manuscript

Abstract

The group knapsack and knapsack problems are generalised to shortest path problems in a class of graphs called knapsack graphs. An efficient algorithm is described for finding shortest paths provided that arc lengths are non-negative. A more efficient algorithm is described for the acyclic case which includes the knapsack problem. In this latter case the algorithm reduces to a known algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E.W. Dijkstra, “A note on two problemsm connection with graphs”,Numerische Mathematik 1 (1959) 269–271.

    Google Scholar 

  2. P.C. Gilmore and R.E. Gomory, “Multistage cutting stock problems of two and more dimensions”,Operations Research 13 (1965) 94–120.

    Google Scholar 

  3. P.C. Gilmore and R.E. Gomory, “The theory and computation of knapsack functions”,Operations Research 14 (1966) 1045–1074.

    Google Scholar 

  4. R.E. Gomory, “On the relation between integer and non-integer solutions to linear programs”,Proceedings of the National Academy of Sciences 53 (1965) 250–265.

    Google Scholar 

  5. R.E. Gomory, “Some polyhedra related to combinatorial problems”,Linear Algebra and its Applications 2 (1969) 451–558.

    Google Scholar 

  6. T.C. Hu,Integer programming and network flows (Addison-Wesley, Reading, Mass., 1969).

    Google Scholar 

  7. E.P. Moore, “The shortest path through a maze”, in:Proceedings of an international symposium on the theory of switching, Part II, Apr. 2–5, 1957 (Harvard University Press, Cambridge, Ma., 1959).

    Google Scholar 

  8. J.F. Shapiro, “Dynamic programming algorithms for the integer programming problem I: The integer programming problem viewed as a knapsack problem”,Operations Research 16 (1968) 103–131.

    Google Scholar 

  9. J.F. Shapiro, “Group theoretic algorithms for the integer programming problem II: Extension to a general algorithm”,Operations Research 16 (1968) 928–947.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of London, London, England

    A. M. Frieze

Authors
  1. A. M. Frieze
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Frieze, A.M. Shortest path algorithms for knapsack type problems. Mathematical Programming 11, 150–157 (1976). https://doi.org/10.1007/BF01580382

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation