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

DOI10.1007/S10100-019-00620-5OpenAlexW2940933596WikidataQ127996566 ScholiaQ127996566MaRDI QIDQ2201314FDOQ2201314

Authors: 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

graph theorylogisticstransportationroutinggrid graph

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout
• Airport management: taxi planning
• Permutation layout
• Title not available (Why is that?)
• On approximating node-disjoint paths in grids

Cited In (2)

• Integer linear programming formulations for the fleet quickest routing problem on grids
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201314)