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

DOI10.1007/S10100-019-00620-5MaRDI QIDQ2201314zbMATH OpenOpenAlexWikidataFDO

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)

Recommendations

• scientific article; zbMATH DE number 5863215
• Integer linear programming formulations for the fleet quickest routing problem on grids
• Packet Routing on the Grid
• Some properties of the fleet assignment problem
• Problems on one way road networks

Cites work

• scientific article; zbMATH DE number 5863215 (Why is no real title available?)
• Airport management: taxi planning
• Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout
• On approximating node-disjoint paths in grids
• Permutation layout

Cited in

(2)

• scientific article; zbMATH DE number 5863215 (Why is no real title available?)
• Integer linear programming formulations for the fleet quickest routing problem on grids

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)