The optimal path problem

Authors

Abstract

In this paper the optimal path problem is studied from a global point of view.
Emphasis is given to the optimality principle since it allows us to design a class of algorithms - the labeling algorithms - which determine an optimal path when the weak optimality principle is satisfied. This property is reinforced with two problems which are similar in their description and completly different in what concerns to their resolution.

Keywords

Network, Path, Optimality Principle, Labeling algorithms

Journal

Investigação Operacional, Vol. 19, pp. 43-60, January 1999