Encontrados 2 documentos, a visualizar página 1 de 1

Ordenado por Data

Computational experiments with a lazy version of a  K  quickest simple path ran...

Pascoal, M.; Captivo, M.; Clímaco, J.

Abstract The quickest path problem is related to the classical shortest path problem, but its objective function concerns the transmission time of a given amount of data throughout a path, which involves both cost and capacity. The K-quickest simple paths problem generalises the latter, by looking for a given number K of simple paths in non-decreasing order of transmission time. Two categories of algorithm...


An interactive bi-objective shortest path approach: searching for unsupported n...

Coutinho-Rodrigues, J. M.; Clí­maco, J. C. N.; Current, J. R.

In many network routing problems several conflicting objectives must be considered. Even for the bi-objective shortest path problem, generating and presenting the whole set of nondominated solutions (paths) to a decision maker, in general, is not effective because the number of these paths can be very large. Interactive procedures are adequate to overcome these drawbacks. Current et al. [1] proposed an interact...


2 Resultados

Texto Pesquisado

Refinar resultados

Autor







Data



Tipo de Documento


Recurso


Assunto








    Financiadores do RCAAP

Fundação para a Ciência e a Tecnologia Universidade do Minho   Governo Português Ministério da Educação e Ciência Programa Operacional da Sociedade do Conhecimento União Europeia