Jogging with APL along the shortest path

Authors:
Moshe Sneidovich;Suzanne Findlay
Affiliations:
-;-
Venue:
APL '92 Proceedings of the international conference on APL
Year:
1992

Citing 3
Cited 1

Dynamic Programming

Dynamic Programming
Discrete Optimization Algorithms with Pascal Programs

Discrete Optimization Algorithms with Pascal Programs
Dynamic Programming

Dynamic Programming

The role of dynamic programming & control structures in performance

APL '95 Proceedings of the international conference on Applied programming languages

Quantified Score

Hi-index	0.00

Visualization

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.