Resource constrained shortest path problems in path planning for fleet management

DOI10.1023/B:JMMA.0000026675.50719.cezbMath1048.90036OpenAlexW1995747983MaRDI QIDQ1876595

Pasquale Avella, Aantonio Sforza, Maurizio Boccia

Publication date: 20 August 2004

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jmma.0000026675.50719.ce

zbMATH Keywords

path planningfleet managementresource constrained shortest path

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (6)

Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles ⋮ Solving resource constrained shortest path problems with LP-based methods ⋮ The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm ⋮ Vehicle Routing Problems with Inter-Tour Resource Constraints ⋮ Resource extension functions: properties, inversion, and generalization to segments ⋮ An exact reduction technique for the k-colour shortest path problem

This page was built for publication: Resource constrained shortest path problems in path planning for fleet management