Strengthened Integer Programming Formulations for the Fleet Quickest Routing Problem on Grid Graphs

GALEAZZO, MARTINA
2020/2021

2020
Strengthened Integer Programming Formulations for the Fleet Quickest Routing Problem on Grid Graphs
vehicle routing
automated vehicles
integer programming
linear programming
valid inequalities
File in questo prodotto:
Non ci sono file associati a questo prodotto.

The text of this website © Università degli studi di Padova. Full Text are published under a non-exclusive license. Metadata are under a CC0 License

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12608/3752