On Alternative Formulations to the Shortest Path Problem with Time Windows and Capacity Constraints
The elementary shortest-path problem with time-windows and capac-ity constraints is a problem used for solving vehicle-routing and crew-scheduling applications. It occurs as a sub-problem used to implicitly generate the set of all feasible routes and schedules in the column-generation formulation of...
Guardado en:
| Autores principales: | Vitale, Ignacio, Dondo, Rodolfo |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2019
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/89663 |
| Aporte de: |
Ejemplares similares
-
A dynamic-pricing label-setting algorithm for solving the elementary resource constrained shortest path problem
por: Vitale, Ignacio, et al.
Publicado: (2020) -
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) -
Towards an R Package for the Shortest Path Problem with Forbidden Paths
por: Vidoni, Melina C., et al.
Publicado: (2018) -
Comparison of HPC Architectures for Computing All-Pairs Shortest Paths: Intel Xeon Phi KNL vs NVIDIA Pascal
por: Costanzo, Manuel, et al.
Publicado: (2020)