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...

Descripción completa

Guardado en:
Detalles Bibliográficos
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