A note on solving the fleet quickest routing problem on a grid graph

DOI10.1007/s10100-019-00620-5OpenAlexW2940933596WikidataQ127996566 ScholiaQ127996566MaRDI QIDQ2201314

Mirko Di Giacomo, Francesco Mason, Marisa Cenci

Publication date: 29 September 2020

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-019-00620-5

zbMATH Keywords

transportationgraph theoryroutinglogisticsgrid graph

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Airport management: taxi planning
• Permutation layout
• Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout
• On Approximating Node-Disjoint Paths in Grids
• Unnamed Item

This page was built for publication: A note on solving the fleet quickest routing problem on a grid graph