The optimal path problem



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.


Network, Path, Optimality Principle, Labeling algorithms


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

Cited by

Year 2004 : 1 citations

 Shortest paths in fuzzy weighted graphs,
Chris Cornelis, Peter De Kesel, Etienne E. Kerre,
International Journal of Intelligent Systems,
Volume 19, Issue 11 , Pages 1051 - 1068

Year 2003 : 1 citations

 The determination of the path with minimum-cost norm value,
José M. P. Paixão, Ernesto de Queirós Vieira Martins, Mário S. Rosa, José Luis E. Santos,
Volume 41, Issue 4 , Pages 184 - 196