A polyhedral study of the elementary shortest path problem with resource constraints

DOI10.1007/978-3-319-68496-3_6zbMath1378.90018OpenAlexW2760777897MaRDI QIDQ1691657

Jiarui Da, Lanbo Zheng, Xin Tang

Publication date: 25 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-68496-3_6

zbMATH Keywords

integer programmingvehicle routing problem with time windowspolyhedral studyelementary shortest path with resource constraints

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

This page was built for publication: A polyhedral study of the elementary shortest path problem with resource constraints