A polyhedral study of the elementary shortest path problem with resource constraints
From MaRDI portal
Publication:1691657
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
integer programmingvehicle routing problem with time windowspolyhedral studyelementary shortest path with resource constraints
This page was built for publication: A polyhedral study of the elementary shortest path problem with resource constraints