Skip to main content
SpringerLink
Log in

Computing shortest paths in networks derived from recurrence relations

  • Section V Heuristics And Paraller Algorithms
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Dynamic programming formulations of optimization problems often call for the computation of shortest paths in networks derived from recurrence relations. These derived networks tend to be very large, but they are also very regular and lend themselves to the computation of nontrivial lower bounds on path lengths. In this tutorial paper, we describe unidirectional and bidirectional search procedures that make use of bounding information in computing shortest paths. When applied to many optimization problems, these shortest path algorithms capture the advantages of both dynamic programming and branch-and-bound.

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. D. de Champeaux and L. Sint, An improved bidirectional heuristic search algorithm, J. ACM 24(1977)177–191.

    Google Scholar 

  2. D. de Champeaux, Bidirectional search again, J. ACM 30(1983)22–32.

    Google Scholar 

  3. E. Dijkstra, A note on two problems in connexion with graphs, Numerische Math. 1(1959) 269–271.

    Google Scholar 

  4. P. Hart, N. Nilsson and B. Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Trans. Sys. Sci. Cyber. SSC-4(1968)100–107.

    Google Scholar 

  5. M. Held, R.M. Karp and R. Shareshian, Assembly-line balancing — Dynamic programming with precedence constraints, Oper. Res. 11(1963)442–452.

    Google Scholar 

  6. E.L. Lawler, M.G. Luby and B. Parker, Finding shortest paths in very large networks,Proc. WG'83, Workshop on Graph Theoretic Concepts in Computer Science, ed. M. Nagle and J. Perl (Trauner Verlag, 1983), pp. 184–199.

  7. T.L. Morin and R.E. Marsten, Branch-and-bound strategies for dynamic programming, Oper. Res. 24(1976)611–627.

    Google Scholar 

  8. I. Pohl, Bi-directional search, in:Machine Intelligence 6, ed. B. Meltzer and D. Michie (Edinburgh University Press, 1971), pp. 127–140.

Download references

Author information

Authors and Affiliations

  1. Computer Science Division, University of California, 94720, Berkeley, CA, USA

    E. L. Lawler

Authors
  1. E. L. Lawler
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dedicated to the memory of Paolo M. Camerini

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lawler, E.L. Computing shortest paths in networks derived from recurrence relations. Ann Oper Res 33, 363–377 (1991). https://doi.org/10.1007/BF02073941

Download citation

  • Issue Date:

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

Keywords

Search

Navigation