A dynamic-pricing label-setting algorithm for solving the elementary resource constrained shortest path problem
The resource constrained elementary shortest-path problem is a problem used for solving vehicle-routing, production-scheduling and crew-scheduling applications. It occurs as a sub-problem used to implicitly generate the set of all feasible columns in a column-generation solution algorithm. In the pr...
Guardado en:
Autores principales: | Vitale, Ignacio, Dondo, Rodolfo |
---|---|
Formato: | Objeto de conferencia |
Lenguaje: | Inglés |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/116727 http://49jaiio.sadio.org.ar/pdfs/siiio/SIIIO-01.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) -
Towards an R Package for the Shortest Path Problem with Forbidden Paths
por: Vidoni, Melina C., et al.
Publicado: (2018) -
Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
Publicado: (2018) -
Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
por: Lera-Romero, G., et al. -
Comparison of HPC Architectures for Computing All-Pairs Shortest Paths: Intel Xeon Phi KNL vs NVIDIA Pascal
por: Costanzo, Manuel, et al.
Publicado: (2020)