Labelling methods for the general case of the multi-objective shortest path problem - a computational study
This paper is devoted to the study of labelling techniques for solving the multi-objective shortest path problem (MSPP) which is an extension of the shortest path problem (SPP) resulting from considering simultaneously more than one cost function (criteria) for the arcs. The generalization of the we...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | other |
| Idioma: | eng |
| Publicado em: |
2007
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10316/11275 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/11275 |