An exact bidirectionalA⋆approach for solving resource-constrained shortest path problems
From MaRDI portal
Publication:3120784
DOI10.1002/net.21856zbMath1409.90049OpenAlexW2898326944MaRDI QIDQ3120784
Barrett W. Thomas, Tobia Calogiuri, Mike Hewitt
Publication date: 19 March 2019
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21856
Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
Related Items (5)
An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Primal column generation framework for vehicle and crew scheduling problems ⋮ An exact bidirectional pulse algorithm for the constrained shortest path ⋮ The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm ⋮ A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization
This page was built for publication: An exact bidirectionalA⋆approach for solving resource-constrained shortest path problems
