Jogging with APL along the shortest path

ABSTRACT

In this paper we examine the classical shortest path problem and illustrate the modelling issues involved in formulating APL codes for a number of generalizations thereof, including multiobjective problems. We also comment on APL's ability to cope with algorithms of this type.

REFERENCES

• 1: Richard Ernest Bellman, Dynamic Programming, Dover Publications, Incorporated, 2003
• 2: M. Sniedovich, The APL Phenomenon: An Operational Research Perspective, European Journal of Operational Research, 38(2), pp. 141-145, (1989).
• 3: Mashe Sniedovich, Dynamic Programming, Marcel Dekker, Inc., New York, NY, 1991
• 4: Maciej Syslo , Narsingh Deo , Janusz S. Kowalik, Discrete Optimization Algorithms with Pascal Programs, Prentice Hall Professional Technical Reference, 1983

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: APL

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Path and circuit problems

General Terms:
Algorithms, Languages