Towards an R Package for the Shortest Path Problem with Forbidden Paths
The shortest path problem with forbidden paths (SPPFP) is a variant of the original shortest path problem. Given a directed graph = ( , ), there is also a related set of known forbidden sub-paths in . The problem is to find the shortest paths from a source to a destination node, with no paths...
Guardado en:
| Autores principales: | Vidoni, Melina C., Vecchietti, Aldo R. |
|---|---|
| Formato: | Objeto de conferencia Resumen |
| Lenguaje: | Inglés |
| Publicado: |
2018
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/72546 http://47jaiio.sadio.org.ar/sites/default/files/LatinR_32.pdf |
| Aporte de: |
Ejemplares similares
-
On Alternative Formulations to the Shortest Path Problem with Time Windows and Capacity Constraints
por: Vitale, Ignacio, et al.
Publicado: (2019) -
Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
por: Lera-Romero, G., et al. -
Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
Publicado: (2018) -
A dynamic-pricing label-setting algorithm for solving the elementary resource constrained shortest path problem
por: Vitale, Ignacio, et al.
Publicado: (2020) -
Comparison of HPC Architectures for Computing All-Pairs Shortest Paths: Intel Xeon Phi KNL vs NVIDIA Pascal
por: Costanzo, Manuel, et al.
Publicado: (2020)