The Optimal Path Problem

The Optimal Path Problem (1999)

Cached

Download Links

by Ernesto de Queirós Vieira Martins , Vieira Martins , Deolinda Maria Lopes Dias Rasteiro , José Luis Esteves dos Santos , Marta Margarida , Marta Margarida Braz Pascoal , Deolinda Maria , Lopes Dias Rasteiro , Jos Luis , Esteves Santos

Citations:

17 - 3 self

Versions

Version History

Metadata Version 1

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The Optimal Path Problem	user correction - Legacy Corrections
AUTHOR NAME	Ernesto de Queirós Vieira Martins	user correction - Legacy Corrections
AUTHOR NAME	Vieira Martins	user correction - Legacy Corrections
AUTHOR NAME	Deolinda Maria Lopes Dias Rasteiro	user correction - Legacy Corrections
AUTHOR NAME	José Luis Esteves dos Santos	user correction - Legacy Corrections
AUTHOR NAME	Marta Margarida	user correction - Legacy Corrections
AUTHOR NAME	Marta Margarida Braz Pascoal	user correction - Legacy Corrections
AUTHOR NAME	Deolinda Maria	user correction - Legacy Corrections
AUTHOR NAME	Lopes Dias Rasteiro	user correction - Legacy Corrections
AUTHOR NAME	Jos Luis	user correction - Legacy Corrections
AUTHOR NAME	Esteves Santos	user correction - Legacy Corrections
ABSTRACT	: In this paper, the optimal path problem will be studied from a global point of view and having no restrictions imposed on the network. The concepts of boundness and finiteness will be presented for the general problem and will be studied in two particular cases. Special emphasis will be given to the optimality principle since it allows one to design a class of algorithms -- the labelling algorithms -- which determine an optimal path when the weak optimality principle is satisfied. Its importance will be stressed by two problems which, in its turn, are similar in their description and completly different in what concerns their resolution. Keywords: network, path, optimality principle, labelling algorithms. 1 Introduction In the optimal path problem, a real function is considered which assigns a value to each path that can be defined between a given pair of nodes in a given network; a path with the best value in a subset of paths between that pair of nodes is what has to be determin...	user correction - Legacy Corrections
YEAR	1999	user correction - Legacy Corrections
CITATIONS	15 found	ParsCit 1.0